SEARCH · Search NASA
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Here, we present a fully discrete approximation technique for the compressible Navier–Stokes equations that is second-order accurate in time and space, semi-implicit, and guaranteed to be invariant domain preserving. The restriction on the time step is the standard hyperbolic CFL condition, i.e. τ ≲ O ( h ) / V where V is some reference velocity scale and h the typical meshsize.
In this article, we introduce a numerical method for approximating the dispersive Serre–Green–Naghdi equations with topography using continuous finite elements. The method is an extension of the hyperbolic relaxation technique introduced in Guermond et al. (J Comput Phys 450:110809, 2022). It is explicit, second-order accurate in space, third-order accurate in time, and is invariant-domain preserving. It is also well balanced and parameter free. Special attention is given to the convex limiting technique when physical source terms are added in the equations. The method is verified with academic benchmarks and validated by comparison with laboratory experimental data.
Here, we consider the parallel-in-time solution of scalar nonlinear conservation laws in one spatial dimension. The equations are discretized in space with a conservative finite-volume method using weighted essentially nonoscillatory (WENO) reconstructions, and in time with high-order explicit Runge–Kutta methods. The solution of the global, discretized space-time problem is sought via a nonlinear iteration that uses a novel linearization strategy in cases of nondifferentiable equations. Under certain choices of discretization and algorithmic parameters, the nonlinear iteration coincides with Newton’s method, although, more generally, it is a preconditioned residual correction scheme. At each nonlinear iteration, the linearized problem takes the form of a certain discretization of a linear conservation law over the space-time domain in question. An approximate parallel-in-time solution of the linearized problem is computed with a single multigrid reduction-in-time (MGRIT) iteration; however, any other effective parallel-in-time method could be used in its place. The MGRIT iteration employs a novel coarse-grid operator that is a modified conservative semi-Lagrangian discretization and generalizes those we have developed previously for nonconservative scalar linear hyperbolic problems. Numerical tests are performed for the inviscid Burgers and Buckley–Leverett equations. For many test problems, the solver converges in just a handful of iterations with a convergence rate independent of mesh resolution, including problems with (interacting) shocks and rarefactions.
The micro-macro (mM) decomposition approach is considered for the numerical solution of the Vlasov– Poisson–Lenard–Bernstein (VPLB) system, which is relevant for plasma physics applications. In the mM approach, the kinetic distribution function is decomposed as $f$ = $\mathscr{E}$[$ρ_f$] + g , where $\mathscr{E}$ is a local equilibrium distribution, depending on the macroscopic moments $ρ_f$ = $∫_{\mathbb{R}}$ $efdv$ = $\langle$$ef$$\rangle$$_{\mathbb{R}}$, where e = (1, $v$, $\frac{1}{2}$ $v^2$) T , and $g$, the microscopic distribution, is defined such that $\langle$$eg$$\rangle$$_{\mathbb{R}}$ = 0. We aim to design numerical methods for the mM decomposition of the VPLB system, which consists of coupled equations for $ρ_f$ and $g$. To this end, we use the discontinuous Galerkin (DG) method for phase-space discretization, and implicit-explicit (IMEX) time integration, where the phase-space advection terms are integrated explicitly and the collision operator is integrated implicitly. We give special consideration to ensure that the resulting mM method maintains the $\langle$$eg$$\rangle$$_{\mathbb{R}}$ = 0 constraint, which may be necessary for obtaining (i) satisfactory results in the collision dominated regime with coarse velocity resolution, and (ii) unambiguous conservation properties. The constraint-preserving property is achieved through a consistent discretization of the equations governing the micro and macro components. Here, we present numerical results that demonstrate the performance of the mM method. The mM method is also compared against a corresponding DG-IMEX method solving directly for $f$.
The determination of the string vertices of closed string field theory is shown to be a conformal field theory problem solvable by combining insights from Liouville theory, hyperbolic geometry, and conformal bootstrap. We first demonstrate how Strebel differentials arise from hyperbolic string vertices by performing a WKB approximation to the associated Fuchsian equation, which we subsequently use it to derive a Polyakov-like conjecture for Strebel differentials. This result implies that the string vertices are generated by the interactions of n zero momentum tachyons, or equivalently, a certain limit of suitably regularized on-shell Liouville action. We argue that the latter can be related to the interaction of three zero momentum tachyons on a generalized cubic vertex through classical conformal blocks. We test this claim for the quartic vertex and discuss its generalization to higher-string interactions.
ZE20 (Mg-2Zn-0.2Ce) 2 is a new wrought magnesium alloy with improved extrudability and mechanical properties [1]. To understand the constitutive behavior and workability of this new alloy, Gleeble thermomechanical testing has been carried out in this study. The flow stress behavior of ZE20 was investigated between 250 °C–450 °C and 10 –3 s –1 –1.0 s –1 in isothermal compression. Constitutive descriptions of the flow stress are provided. A new general approach at application of the extended Ludwik equation is demonstrated and was found to be more accurate than the hyperbolic sine Arrhenius model while having a similar number of model constants. Processing maps were developed based on the experimental results and are verified with microstructural investigation. A region of safe processing with non-basal texture and high activity of dynamic recrystallization (DRX) was found between 375 °C and 450 °C, from 10 –1 s –1 to 10–2.5 s –1 . A region of potentially safe processing with annealing that is associated with shear band nucleation of non-basal grains was identified for temperatures as low as 300 °C and rates as high as 10 –1 s –1 .
In this article we present a class of high order unconditionally strong stability preserving (SSP) implicit two-derivative Runge--Kutta schemes and SSP implicit-explicit (IMEX) multi-derivative Runge--Kutta schemes where the time-step restriction is independent of the stiff term. The unconditional SSP property for a method of order $p>2$ is unique among SSP methods and depends on a backward-in-time assumption on the derivative of the operator. We show that this backward derivative condition is satisfied in many relevant cases where SSP IMEX schemes are desired. We devise unconditionally SSP implicit Runge--Kutta schemes of order up to $p=4$ and IMEX Runge--Kutta schemes of order up to $p=3$. For the multiderivative IMEX schemes, we also derive and present the order conditions, which have not appeared previously. The unconditional SSP condition ensures that these methods are positivity preserving, and we present sufficient conditions under which such methods are also asymptotic preserving when applied to a range of problems, including a hyperbolic relaxation system, the Broadwell model, and the Bhatnagar--Gross--Krook kinetic equation. We present numerical results to support the theoretical results on a variety of problems.
In this paper, a least-squares finite element method for scalar nonlinear hyperbolic balance laws is proposed and studied. The approach is based on a formulation that utilizes an appropriate Helmholtz decomposition of the flux vector and is related to the standard notion of a weak solution. This relationship, together with a corresponding connection to negative-norm least-squares, is described in detail. As a consequence, an important numerical conservation theorem is obtained, similar to the famous Lax–Wendroff theorem. The numerical conservation properties of the method in this paper do not fall precisely in the framework introduced by Lax and Wendroff, but they are similar in spirit as they guarantee that when L 2 convergence holds, the resulting approximations approach a weak solution to the hyperbolic problem. The least-squares functional is continuous and coercive in an H -1 -type norm, but not L 2 -coercive. Nevertheless, the L 2 convergence properties of the method are discussed. Convergence can be obtained either by an explicit regularization of the functional, that provides control of the L 2 norm, or by properly choosing the finite element spaces, providing implicit control of the L 2 norm. Numerical results for the inviscid Burgers equation with discontinuous source terms are shown, demonstrating the L 2 convergence of the obtained approximations to the physically admissible solution. The numerical method utilizes a least-squares functional, minimized on finite element spaces, and a Gauss–Newton technique with nested iteration. Finally, we believe that the linear systems encountered with this formulation are amenable to multigrid techniques and combining the method with adaptive mesh refinement would make this approach an efficient tool for solving balance laws (this is the focus of a future study).
The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current stateof-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, we take inspiration from the Least Squares Shadowing (LSS by Wang) approach for solving chaotic problems. Here, an optimization approach is able to find “well-conditioned” shadow trajectories/solutions to the original “ill-conditioned” chaotic problem. Thus, the new multigrid methods researched here also arise in an optimization context.
Hyperbolic lattices are a revolutionary platform for tabletop simulations of holography and quantum physics in curved space and facilitate efficient quantum error correcting codes. Their underlying geometry is non-Euclidean, and the absence of Bloch's theorem precludes the straightforward application of the often indispensable energy band theory to study model Hamiltonians on hyperbolic lattices. Motivated by recent insights into hyperbolic band theory, we initiate a crystallography of hyperbolic lattices. Here we show that many hyperbolic lattices feature a hidden crystal structure characterized by unit cells, hyperbolic Bravais lattices, and associated symmetry groups. Using the mathematical framework of higher-genus Riemann surfaces and Fuchsian groups, we derive a list of example hyperbolic {p,q} lattices and their hyperbolic Bravais lattices, including five infinite families and several graphs relevant for experiments in circuit quantum electrodynamics and topolectrical circuits. This dramatically simplifies the computation of energy spectra of tight-binding Hamiltonians on hyperbolic lattices, from exact diagonalization on the graph to solving a finite set of equations in terms of irreducible representations. The significance of this achievement needs to be compared to the all-important role played by conventional Euclidean crystallography in the study of solids. We exemplify the high potential of this approach by constructing and diagonalizing finite-dimensional Bloch wave Hamiltonians.
The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallelin-time methods, with the most common method, parareal, diverging in many cases. The current state-of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be implemented in a high-performance but general way in XBraid and explored for more complicated problems. We will additionally research, as time allows, improvements to these techniques, as well as multigrid relaxation techniques based on Least Squares Shadowing (LSS by Wang) and a nonintrusive block tridiagonal solver based on MGRIT, called TriMGRIT.
The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations (PDEs), which typically use traditional sequential time stepping methods. Since this traditional approach is inherently serial, it presents a sequential bottleneck when moving to exascale computing, because future performance gains will come through greater concurrency, not faster clock speeds. Thus, the goal of this work is to research parallelism in time, i.e., methods that compute multiple time values simultaneously, not sequentially. The focus will be on hyperbolic and chaotic problems of interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures. The chosen methodology for solving these problems parallel-in-time is multigrid, because multigrid (when it works) is a powerful, optimal, and scalable solver for discretized PDEs. Multigrid is already commonly used in many DOE simulations for scalably and optimally solving space-only PDE problems. The areas of hyperbolic and chaotic problems are chosen because of their relevance to problems of programmatic interest to DOE. However, these problems are also well-known to be difficult for parallel-in-time methods, with the most common method, parareal, diverging in many cases. The current state of-the-art for parallel-in-time at LLNL is the multigrid reduction in time (MGRIT) XBraid package, which also struggles for such problems, while still showing some improvement over parareal. In summary, new methods are needed for an efficient parallel-in-time scheme for hyperbolic and chaotic problems, and this work shall research promising new multigrid methods in this area. In particular, this work shall continue researching the directions from the current collaboration with Dr. Falgout, which are laid out in the work Toward Parallel in Time for Chaotic Dynamical Systems and showed the first known results of a parallel-in-time speedup for a chaotic problem. This work outlines two key improvements to XBraid for chaotic problems, the so-called “theta” and “delta-correction” methods. Here, these two improvements will be further researched and improved (including with a new relaxation method inspired by on Least Squares Shadowing (LSS)) and explored for more complicated problems.
We present the first set of fully-nonlinear, necessary and sufficient conditions guaranteeing causal evolution of the initial data for the Israel-Stewart hydrodynamic equations with shear and bulk viscosity coupled to a nonzero baryon current. These constraints not only provide nonlinear causality: they also (a) guarantee the existence of a locally well-posed evolution of the initial data (they enforce strong hyperbolicity) when excluding the endpoints of the bounds, (b) arise from purely algebraic constraints that make no underlying symmetry assumptions on the degrees of freedom and (c) propagate the relevant symmetries of the degrees of freedom over the entire evolution of the problem. Our work enforces a mathematically rigorous foundation for future studies of viscous relativistic hydrodynamics with baryon-rich matter including neutron star mergers and heavy-ion collisions.
We investigate the two-dimensional (2D) inviscid compressible flow equations in axisymmetric coordinates, constrained by an ideal gas equation of state (EOS). Beginning with the assumption that the 2D velocity field is space-time separable and linearly variable in each corresponding spatial coordinate, we proceed to derive an in nite family of elliptic or hyperbolic, uniformly expanding or contracting \gas cloud" solutions. Construction of specific example solutions belonging to this family is dependent on the solution of a system of nonlinear, coupled, second-order ordinary differential equations, and the prescription of an additional physical process of interest (e.g., uniform temperature or uniform entropy flow). The physical and computational implications of these solutions as pertaining to quantitative code verification or model qualification studies are discussed in some detail.
We reconsider the role of wormholes in the AdS/CFT correspondence. We focus on Euclidean wormholes that connect two asymptotically AdS or hyperbolic regions with $\mathbb{S}$ 1 × $\mathbb{S}$ d-1 boundary. There is no solution to Einstein’s equations of this sort, as the wormholes possess a modulus that runs to infinity. To find on-shell wormholes we must stabilize this modulus, which we can do by fixing the total energy on the two boundaries. Such a wormhole gives the saddle point approximation to a non-standard problem in quantum gravity, where we fix two asymptotic boundaries and constrain the common energy. Crucially the dual quantity does not factorize even when the bulk is dual to a single CFT, on account of the fixed energy constraint. From this quantity we extract a smeared version of the microcanonical spectral form factor. For a chaotic theory this quantity is self-averaging, i.e. well-approximated by averaging over energy windows, or over coupling constants. We go on to give a precision test involving the microcanonical spectral form factor where the two replicas have slightly different coupling constants. In chaotic theories this form factor is known to smoothly decay at a rate universally predicted in terms of one replica physics, provided that there is an average either over a window or over couplings. We compute the expected decay rate for holographic theories, and the form factor from a wormhole, and the two exactly agree for a wide range of two-derivative effective field theories in AdS. This gives a precision test of averaging in AdS/CFT. Our results interpret a number of confusing facts about wormholes and factorization in AdS and suggest that we should regard gravitational effective field theory as a mesoscopic description, analogous to semiclassical mesoscopic descriptions of quantum chaotic systems.
Here we introduce DynAMO, a reinforcement learning paradigm for Dynamic Anticipatory Mesh Optimization. Adaptive mesh refinement is an effective tool for optimizing computational cost and solution accuracy in numerical methods for partial differential equations. However, traditional adaptive mesh refinement approaches for time-dependent problems typically rely only on instantaneous error indicators to guide adaptivity. As a result, standard strategies often require frequent remeshing to maintain accuracy. In the DynAMO approach, multi-agent reinforcement learning is used to discover new local refinement policies that can anticipate and respond to future solution states by producing meshes that deliver more accurate solutions for longer time intervals. By applying DynAMO to discontinuous Galerkin methods for the linear advection and compressible Euler equations in two dimensions, we demonstrate that this new mesh refinement paradigm can outperform conventional threshold-based strategies while also generalizing to different mesh sizes, remeshing and simulation times, and initial conditions.
Hyperbolic geometry on the one-bordered torus is numerically uniformized using Liouville theory. This geometry is relevant for the hyperbolic string tadpole vertex describing the one-loop quantum corrections of closed string field theory. We argue that the Lamé equation, upon fixing its accessory parameter via Polyakov conjecture, provides the input for the characterization. The explicit expressions for the Weil-Petersson metric as well as the local coordinates and the associated vertex region for the tadpole vertex are given in terms of classical torus conformal blocks. The relevance of this vertex for vacuum shift computations in string theory is highlighted.
The magnetohydrodynamics (MHD) equations are continuum models used in the study of a wide range of plasma physics systems, including the evolution of complex plasma dynamics in tokamak disruptions. However, efficient numerical solution methods for MHD are extremely challenging due to disparate time and length scales, strong hyperbolic phenomena, and nonlinearity. Additionally, therefore the development of scalable, implicit MHD algorithms and high-resolution adaptive mesh refinement strategies is of considerable importance. In this work, we develop a high-order stabilized finite-element algorithm for the reduced visco-resistive MHD equations based on the MFEM finite element library (mfem.org). The scheme is fully implicit, solved with the Jacobian-free Newton-Krylov (JFNK) method with a physics-based preconditioning strategy. Our preconditioning strategy is a generalization of the physics-based preconditioning methods in Chacón et al. (2002) to adaptive, stabilized finite elements. Algebraic multigrid methods are used to invert sub-block operators to achieve scalability. A parallel adaptive mesh refinement scheme with dynamic load-balancing is implemented to efficiently resolve the multi-scale spatial features of the system. Our implementation uses the MFEM framework, which provides arbitrary-order polynomials and flexible adaptive conforming and non-conforming meshes capabilities. Results demonstrate the accuracy, efficiency, and scalability of the implicit scheme in the presence of large scale disparity. The potential of the AMR approach is demonstrated on an island coalescence problem in the high Lundquist-number regime (≥ 10 7 ) with the successful resolution of plasmoid instabilities and thin current sheets.