Search NASA⌕ Search

SEARCH · Search NASA

Results for “Hyperbolic equations”

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.

At least 37 records · Page 2

Approximate Synthesis of Distributed Optimal Control for Hyperbolic Equations with Rapidly Oscillating Coefficients

We study the problem of finding approximations to the optimal control with respect to a quadratic-type quality criterion in the form of feedback (synthesis) for a linear-quadratic problem in the from of a hyperbolic equation with rapidly oscillating coefficients and distributed control on the right-hand side. On the basis of the exact formula of synthesis, its approximate version (based on the replacement of the rapidly oscillating variables by averaged quantities) is substantiated.

97 MATHEMATICS AND COMPUTING↗

Parallel High Order Accuracy Methods Applied to Non-Linear Hyperbolic Equations and to Problems in Materials Sciences

Note: This grant was originally awarded to Professor David Gottlieb and the majority of the work envisioned reflects his original ideas. However, when Prof Gottlieb passed away in December 2008, Professor Hesthaven took over as PI to ensure proper mentoring of students and postdoctoral researchers already involved in the project. This unusual circumstance has naturally impacted the project and its timeline. However, as the report reflects, the planned work has been accomplished and some activities beyond the original scope have been pursued with success. Project overview and main results: The effort in this project focuses on the development of high order accurate computational methods for the solution of hyperbolic equations with application to problems with strong shocks. While the methods are general, emphasis is on applications to gas dynamics with strong shocks.

36 MATERIALS SCIENCE↗

Grid generation for general 2-D regions using hyperbolic equations

A method for applying a hyperbolic grid generation scheme to the construction of meshes in general 2-D regions has been developed. This approach, which follows the theory developed by Steger and Chaussee (1980) and the algorithm outlined by Kinsey and Barth (1984), is based on improving local grid control. This is accomplished by adding an angle control source term to the equations and using a new algorithm for computing the volume source term. These modifications lead to superior methods for fixing the 'local' problems of hyperbolic grid generation, namely, propagation of initial discontinuities and formation of grid shocks (crossing grid lines). More importantly, a method for solving the global problem of constraining the grid with more than one boundary (internal grid generation) has been developed. These algorithms have been implemented in an interactive grid generation program and the results for several geometries are presented and discussed.

Cordova, Jeffrey Q.↗

Optimality Conditions for Semilinear Hyperbolic Equations with Controls in Coefficients

An optimal control problem for semilinear hyperbolic partial differential equations is considered. The control variable appears in coefficients. Necessary conditions for optimal controls are established by method of two-scale convergence and homogenized spike variation. Results for problems with state constraints are also stated.

97 MATHEMATICS AND COMPUTING↗

A parallel iterative solution method for systems of nonlinear hyperbolic equations

An iterative algorithm suitable for the solution of a system of nonlinear hyperbolic partial differentiation equations in multiple dimensions is discussed. Current numerical methods for systems of nonlinear PDEs have limited parallelism due to strong coupling between the equations. This method decouples the PDEs by linearizing the convention coefficient for a space-time domain. This provides large grain parallelism. The linearization also allows the treatment of some terms in the equations as source terms, providing more freedom to choose from a wider variety of numerical methods. Smaller grain parallelism may be exploited within the solves for each equation. Thus, the method has potential for parallelism at several levels.

Scroggs, Jeffrey S.↗

A pseudospectral Legendre method for hyperbolic equations with an improved stability condition

A new pseudospectral method is introduced for solving hyperbolic partial differential equations. This method uses different grid points than previously used pseudospectral methods: in fact the grid are related to the zeroes of the Legendre polynomials. The main advantage of this method is that the allowable time step is proportional to the inverse of the number of grid points 1/N rather than to 1/n(2) (as in the case of other pseudospectral methods applied to mixed initial boundary value problems). A highly accurate time discretization suitable for these spectral methods is discussed.

Tal-Ezer, H.↗

A pseudospectral Legendre method for hyperbolic equations with an improved stability condition

A new pseudospectral method is introduced for solving hyperbolic partial differential equations. This method uses different grid points than previously used pseudospectral methods: in fact the grid points are related to the zeroes of the Legendre polynomials. The main advantage of this method is that the allowable time step is proportional to the inverse of the number of grid points 1/N rather than to 1/n(2) (as in the case of other pseudospectral methods applied to mixed initial boundary value problems). A highly accurate time discretization suitable for these spectral methods is discussed.

Tal-Ezer, Hillel↗

Stability analysis of numerical boundary conditions and implicit difference approximations for hyperbolic equations

Implicit, noniterative, finite difference schemes were recently developed by several authors for multidimensional systems of nonlinear hyperbolic partial differential equations. When applied to linear model equations with periodic boundary conditions those schemes are unconditionally stable (A-stable). As applied in practice the algorithms often face a severe time step restriction. A major source of the difficulty is the treatment of the numerical boundary conditions. One conjecture was that unconditional stability requires implicit numerical boundary conditions. An apparent counter example was the space time extrapolation considered by Gustafsson, Kreiss, and Sunstrom. Spatial (implicit) and space time (explicit) extrapolation using normal mode analysis for a finite and infinite number of spatial mesh intervals are examined. The results indicate that for unconditional stability with a finite number of spatial mesh intervals, the numerical boundary conditions must be implicit.

Beam, R. M.↗

The solution of non-linear hyperbolic equation systems by the finite element method

A finite-element method for the solution of nonlinear hyperbolic systems of equations, such as those encountered in non-self-adjoint problems of transient phenomena in convection-diffusion or in the mixed representation of wave problems, is developed and demonstrated. The problem is rewritten in moving coordinates and reinterpolated to the original mesh by a Taylor expansion prior to a standard Galerkin spatial discretization, and it is shown that this procedure is equivalent to the time-discretization approach of Donea (1984). Numerical results for sample problems are presented graphically, including such shallow-water problems as the breaking of a dam, the shoaling of a wave, and the outflow of a river; compressible flows such as the isothermal flow in a nozzle and the Riemann shock-tube problem; and the two-dimensional scalar-advection, nonlinear-shallow-water, and Euler equations.

Loehner, R.↗

Spectral methods in time for hyperbolic equations

A pseudospectral numerical scheme for solving linear, periodic, hyperbolic problems is described. It has infinite accuracy both in time and in space. The high accuracy in time is achieved without increasing the computational work and memory space which is needed for a regular, one step explicit scheme. The algorithm is shown to be optimal in the sense that among all the explicit algorithms of a certain class it requires the least amount of work to achieve a certain given resolution. The class of algorithms referred to consists of all explicit schemes which may be represented as a polynomial in the spatial operator.

Tal-Ezer, H.↗

Computing with high-resolution upwind schemes for hyperbolic equations

Computational aspects of modern high-resolution upwind finite-difference schemes for hyperbolic systems of conservation laws are examined. An operational unification is demonstrated for constructing a wide class of flux-difference-split and flux-split schemes based on the design principles underlying total variation diminishing (TVD) schemes. Consideration is also given to TVD scheme design by preprocessing, the extension of preprocessing and postprocessing approaches to general control volumes, the removal of expansion shocks and 'glitches', relaxation methods for implicit TVD schemes, and a new family of high-accuracy TVD schemes.

Chakravarthy, S. R.↗

Sharp Observability Estimates for a System of Two Coupled Nonconservative Hyperbolic Equations

We consider a system of two coupled nonconservative wave equations. For this system, we prove several observability estimates. Those observability estimates are sharp in the sense that they lead by duality to the controllability (exact or approximate) of the coupled system with a single control acting through one of the equations only while keeping the same controllability time as for a single equation. Existing results in the literature either require two controls, or in the case of a single control, they have a controllability time that blows up as the coupling parameter goes to zero. Our proofs rely on: (i) Carleman estimates, (ii) energy estimates and (iii) localizing arguments. The results obtained complement and improve, in some sense, earlier results while at the same time providing new uniqueness results.

97 MATHEMATICS AND COMPUTING↗

Local error estimates for discontinuous solutions of nonlinear hyperbolic equations

Let u(x,t) be the possibly discontinuous entropy solution of a nonlinear scalar conservation law with smooth initial data. Suppose u sub epsilon(x,t) is the solution of an approximate viscosity regularization, where epsilon greater than 0 is the small viscosity amplitude. It is shown that by post-processing the small viscosity approximation u sub epsilon, pointwise values of u and its derivatives can be recovered with an error as close to epsilon as desired. The analysis relies on the adjoint problem of the forward error equation, which in this case amounts to a backward linear transport with discontinuous coefficients. The novelty of this approach is to use a (generalized) E-condition of the forward problem in order to deduce a W(exp 1,infinity) energy estimate for the discontinuous backward transport equation; this, in turn, leads one to an epsilon-uniform estimate on moments of the error u(sub epsilon) - u. This approach does not follow the characteristics and, therefore, applies mutatis mutandis to other approximate solutions such as E-difference schemes.

Tadmor, Eitan↗

Quadrature-Free Implementation of the Discontinuous Galerkin Method for Hyperbolic Equations

A discontinuous Galerkin formulation that avoids the use of discrete quadrature formulas is described and applied to linear and nonlinear test problems in one and two space dimensions. This approach requires less computational time and storage than conventional implementations but preserves the compactness and robustness inherent to the discontinuous Galerkin method. Test problems include both linear and nonlinear one-dimensional scalar advection of botH smooth and discontinuous initial value problems, two-dimensional scalar advection of smooth initial value problems discretized by using unstructured grids with varying degrees of smoothness and regularity, and two-dimensional linear Euler solutions on unstructured grids.

Atkins, H. L.↗