SEARCH · Search NASA

Results for “HYPERBOLIC EQUATION”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 379 records · Page 21

All sources NASA NTRS DOE OSTI

DOE OSTI2020

A least-squares finite element method based on the Helmholtz decomposition for hyperbolic balance laws

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).

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1986

Stability of semidiscrete approximations for hyperbolic initial-boundary-value problems: An eigenvalue analysis

A hyperbolic initial-boundary-value problem can be approximated by a system of ordinary differential equations (ODEs) by replacing the spatial derivatives by finite-difference approximations. The resulting system of ODEs is called a semidiscrete approximation. A complication is the fact that more boundary conditions are required for the spatially discrete approximation than are specified for the partial differential equation. Consequently, additional numerical boundary conditions are required and improper treatment of these additional conditions can lead to instability. For a linear initial-boundary-value problem (IBVP) with homogeneous analytical boundary conditions, the semidiscrete approximation results in a system of ODEs of the form du/dt = Au whose solution can be written as u(t) = exp(At)u(O). Lax-Richtmyer stability requires that the matrix norm of exp(At) be uniformly bounded for O less than or = t less than or = T independent of the spatial mesh size. Although the classical Lax-Richtmyer stability definition involves a conventional vector norm, there is no known algebraic test for the uniform boundedness of the matrix norm of exp(At) for hyperbolic IBVPs. An alternative but more complicated stability definition is used in the theory developed by Gustafsson, Kreiss, and Sundstrom (GKS). The two methods are compared.

Warming, Robert F.↗

DOE OSTI2022

Parallel Multigrid in Time and Space for Extreme-Scale Computational Science: Chaotic and Hyperbolic Problems

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.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2001

Discontinuous Galerkin Methods for NonLinear Differential Systems

This talk considers simplified finite element discretization techniques for first-order systems of conservation laws equipped with a convex (entropy) extension. Using newly developed techniques in entropy symmetrization theory, simplified forms of the discontinuous Galerkin (DG) finite element method have been developed and analyzed. The use of symmetrization variables yields numerical schemes which inherit global entropy stability properties of the PDE (partial differential equation) system. Central to the development of the simplified DG methods is the Eigenvalue Scaling Theorem which characterizes right symmetrizers of an arbitrary first-order hyperbolic system in terms of scaled eigenvectors of the corresponding flux Jacobian matrices. A constructive proof is provided for the Eigenvalue Scaling Theorem with detailed consideration given to the Euler equations of gas dynamics and extended conservation law systems derivable as moments of the Boltzmann equation. Using results from kinetic Boltzmann moment closure theory, we then derive and prove energy stability for several approximate DG fluxes which have practical and theoretical merit.

Barth, Timothy↗

DOE OSTI2022

Crystallography of hyperbolic lattices

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.

2-dimensional systems↗

NASA NTRS1985

Implicit Total Variation Diminishing (TVD) schemes for steady-state calculations

The novel implicit and unconditionally stable, high resolution Total Variation Diminishing (TVD) scheme whose application to steady state calculations is presently examined is a member of a one-parameter family of implicit, second-order accurate systems developed by Harten (1983) for the computation of weak solutions for one-dimensional hyperbolic conservation laws. The scheme will not generate spurious oscillations for a nonlinear scalar equation and a constant coefficient system. Numerical experiments for a quasi-one-dimensional nozzle problem show that the experimentally determined stability limit correlates exactly with the theoretical stability limit for the nonlinear scalar hyberbolic conservation laws.

Yee, H. C.↗

DOE OSTI2023

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

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.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Multigrid Reduction in Time for Chaotic and Hyperbolic Problems (Final Report)

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.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1985

Finite element algorithms for compressible flow computation on a supercomputer

Methods of applying computational fluid dynamics techniques to engineering problems are discussed. The linking factors between theoretical and applied research are the shape and weight functions which produce the Galerkin finite element schemes. The flow is unsteady, viscous, heat conducting and compressible, and steady-state flows are the asymptotic limit of unsteady flows. All flows are described by the time-averaged Navier-Stokes equations (NSE) with mass and energy conservation. Local curvilinear intrinsic coordinates are applied to discretize the NSE in arbitrary geometric domains. A modified weighted residuals approach defines the discrete analogs of the physical systems modeled and a general interpolants method is used to derive families of numerical models, both implicit and explicit, finite difference and finite elemnt, from a single point of departure. Time-dependent element approximations are achieved with a progressive assembly of generalized elements method. Hyperbolic steady-state Euler algorithms and quasi-parabolic are spatial marching algorithms for solving the discretized equations. Application of the techniques is illustrated through calculation of the compressible flow around a hypersonic flight vehicle at 100,000 ft at zero angle of attack at speeds of Mach 4-10.

Spradley, L. W.↗

NASA NTRS1995

An approach to the development of numerical algorithms for first order linear hyperbolic systems in multiple space dimensions: The constant coefficient case

Two methods for developing high order single step explicit algorithms on symmetric stencils with data on only one time level are presented. Examples are given for the convection and linearized Euler equations with up to the eighth order accuracy in both space and time in one space dimension, and up to the sixth in two space dimensions. The method of characteristics is generalized to nondiagonalizable hyperbolic systems by using exact local polynominal solutions of the system, and the resulting exact propagator methods automatically incorporate the correct multidimensional wave propagation dynamics. Multivariate Taylor or Cauchy-Kowaleskaya expansions are also used to develop algorithms. Both of these methods can be applied to obtain algorithms of arbitrarily high order for hyperbolic systems in multiple space dimensions. Cross derivatives are included in the local approximations used to develop the algorithms in this paper in order to obtain high order accuracy, and improved isotropy and stability. Efficiency in meeting global error bounds is an important criterion for evaluating algorithms, and the higher order algorithms are shown to be up to several orders of magnitude more efficient even though they are more complex. Stable high order boundary conditions for the linearized Euler equations are developed in one space dimension, and demonstrated in two space dimensions.

Goodrich, John W.↗

NASA NTRS1973

Relaxation methods for transonic flow about wing-cylinder combinations and lifting swept wings

The mixed elliptic-hyperbolic relaxation method for obtaining steady-state solutions to two-dimensional transonic potential equations is extended to the transonic small disturbance equation in three dimensions. In particular, transonic flow is considered both about nonlifting wing-cylinder combinations and over thin lifting wings with sweep and taper. The treatment is restricted to freestream Mach numbers less than one and to wings with subsonic trailing edges.

Bailey, F. R.↗

NASA NTRS1975

On the Navier-Stokes equations with constant total temperature

For various applications in fluid dynamics, it is assumed that the total temperature is constant. Therefore, the energy equation can be replaced by an algebraic relation. The resulting set of equations in the inviscid case is analyzed. It is shown that the system is strictly hyperbolic and well posed for the initial value problems. Boundary conditions are described such that the linearized system is well posed. The Hopscotch method is investigated and numerical results are presented.

Gottlieb, D.↗

NASA NTRS1982

Computation of three-dimensional inviscid flow over hypersonic missile configurations using the GIM code

A three-dimensional computational technique was used to obtain flowfield solutions to the Euler equations over selected hypersonic missile configurations. The General Interpolants Method (GIM) computer code was used with interpolation functions in an algebraic approach to generate a discrete computational grid for each configuration. The spatial marching version of the GIM code, which treats the parabolized Navier-Stokes (PNS) equations or the Euler equations with a shock capturing, 'MacCormack-like' scheme, was used to advance the solution hyperbolically over each configuration. The inviscid flowfield solutions over the two three-dimensional missile configurations, calculated using the GIM hyperbolic scheme, are presented here. The flow field over a wing/body configuration at zero degree angle of attack is presented. Flow over the fuselage of a tactical missile, termed the TAME 10, at both zero degree and 7.5 degree angles of attack is presented. In addition, an inviscid, two-dimensional analysis of an inlet configuration designed to mount on the TAME 10 is included. Contour maps of velocity and pressure are included for each configuration. Comparison of calculation and data show good agreement.

Xiques, K. E.↗

NASA NTRS1987

Acoustic gravity waves: A computational approach

This paper discusses numerical solutions of a hyperbolic initial boundary value problem that arises from acoustic wave propagation in the atmosphere. Field equations are derived from the atmospheric fluid flow governed by the Euler equations. The resulting original problem is nonlinear. A first order linearized version of the problem is used for computational purposes. The main difficulty in the problem as with any open boundary problem is in obtaining stable boundary conditions. Approximate boundary conditions are derived and shown to be stable. Numerical results are presented to verify the effectiveness of these boundary conditions.

Hariharan, S. I.↗

NASA NTRS1988

Acoustic gravity waves - A computational approach

Hariharan, S. I.↗

NASA NTRS1998

Gas-Kinetic Theory Based Flux Splitting Method for Ideal Magnetohydrodynamics

A gas-kinetic solver is developed for the ideal magnetohydrodynamics (MHD) equations. The new scheme is based on the direct splitting of the flux function of the MHD equations with the inclusion of "particle" collisions in the transport process. Consequently, the artificial dissipation in the new scheme is much reduced in comparison with the MHD Flux Vector Splitting Scheme. At the same time, the new scheme is compared with the well-developed Roe-type MHD solver. It is concluded that the kinetic MHD scheme is more robust and efficient than the Roe- type method, and the accuracy is competitive. In this paper the general principle of splitting the macroscopic flux function based on the gas-kinetic theory is presented. The flux construction strategy may shed some light on the possible modification of AUSM- and CUSP-type schemes for the compressible Euler equations, as well as to the development of new schemes for a non-strictly hyperbolic system.

Xu, Kun↗

NASA NTRS2012

Combining Ratio Estimation for Low Density Parity Check (LDPC) Coding

The Low Density Parity Check (LDPC) Code decoding algorithm make use of a scaled receive signal derived from maximizing the log-likelihood ratio of the received signal. The scaling factor (often called the combining ratio) in an AWGN channel is a ratio between signal amplitude and noise variance. Accurately estimating this ratio has shown as much as 0.6 dB decoding performance gain. This presentation briefly describes three methods for estimating the combining ratio: a Pilot-Guided estimation method, a Blind estimation method, and a Simulation-Based Look-Up table. The Pilot Guided Estimation method has shown that the maximum likelihood estimates of signal amplitude is the mean inner product of the received sequence and the known sequence, the attached synchronization marker (ASM) , and signal variance is the difference of the mean of the squared received sequence and the square of the signal amplitude. This method has the advantage of simplicity at the expense of latency since several frames worth of ASMs. The Blind estimation method s maximum likelihood estimator is the average of the product of the received signal with the hyperbolic tangent of the product combining ratio and the received signal. The root of this equation can be determined by an iterative binary search between 0 and 1 after normalizing the received sequence. This method has the benefit of requiring one frame of data to estimate the combining ratio which is good for faster changing channels compared to the previous method, however it is computationally expensive. The final method uses a look-up table based on prior simulated results to determine signal amplitude and noise variance. In this method the received mean signal strength is controlled to a constant soft decision value. The magnitude of the deviation is averaged over a predetermined number of samples. This value is referenced in a look up table to determine the combining ratio that prior simulation associated with the average magnitude of the deviation. This method is more complicated than the Pilot-Guided Method due to the gain control circuitry, but does not have the real-time computation complexity of the Blind Estimation method. Each of these methods can be used to provide an accurate estimation of the combining ratio, and the final selection of the estimation method depends on other design constraints.

Mahmoud, Saad↗

DOE OSTI2026

Nonlinear causality and strong hyperbolicity of baryon-rich Israel-Stewart hydrodynamics

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.

Cordeiro, Ian [University of Illinois Urbana-Champ↗