Search NASA⌕ Search

SEARCH · Search NASA

Results for “hyperbolic problems”

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 91 records · Page 5

Estimation of discontinuous coefficients and boundary parameters for hyperbolic systems

The problem of estimating discontinuous coefficients, including locations of discontinuities, that occur in second order hyperbolic systems typical of those arising in I-D surface seismic problems is discussed. In addition, the problem of identifying unknown parameters that appear in boundary conditions for the system is treated. A spline-based approximation theory is presented, together with related convergence findings and representative numerical examples.

Lamm, P. K.↗

Estimation of discontinuous coefficients and boundary parameters for hyperbolic systems

The problem of estimating discontinuous coefficients, including locations of discontinuities, that occur in second-order hyperbolic systems typical of those arising in one-dimensional surface seismic problems, is considered. The problem of identifying unknown parameters that appear in boundary conditions for the system is addressed. A spline-based approximation theory is presented as well as related convergence findings and representative numerical examples.

Lamm, Patricia K.↗

Subcell limiting strategies for discontinuous Galerkin spectral element methods

Here, we present a general family of subcell limiting strategies to construct robust high-order accurate nodal discontinuous Galerkin (DG) schemes. The main strategy is to construct compatible low order finite volume (FV) type discretizations that allow for convex blending with the high-order variant with the goal of guaranteeing additional properties, such as bounds on physical quantities and/or guaranteed entropy dissipation. For an implementation of this main strategy, four main ingredients are identified that may be combined in a flexible manner: (i) a nodal high-order DG method on Legendre–Gauss–Lobatto nodes, (ii) a compatible robust subcell FV scheme, (iii) a convex combination strategy for the two schemes, which can be element-wise or subcell-wise, and (iv) a strategy to compute the convex blending factors, which can be either based on heuristic troubled-cell indicators, or using ideas from flux-corrected transport methods. By carefully designing the metric terms of the subcell FV method, the resulting methods can be used on unstructured curvilinear meshes, are locally conservative, can handle strong shocks efficiently while directly guaranteeing physical bounds on quantities such as density, pressure or entropy. We further show that it is possible to choose the four ingredients to recover existing methods such as a provably entropy dissipative subcell shock-capturing approach or a sparse invariant domain preserving approach. We test the versatility of the presented strategies and mix and match the four ingredients to solve challenging simulation setups, such as the KPP problem (a hyperbolic conservation law with non-convex flux function), turbulent and hypersonic Euler simulations, and MHD problems featuring shocks and turbulence.

97 MATHEMATICS AND COMPUTING↗

Uncertainty quantification methodology for hyperbolic systems with application to blood flow in arteries

We present a Stochastic Finite Volume - ADER (SFV-ADER) methodology for Uncertainty Quantification (UQ) in the general framework of systems of hyperbolic balance laws with uncertainty in parameters. The resulting method is weakly intrusive, meaning that deterministic solvers need minor modifications to include random contributions, and has no theoretical accuracy barrier. An illustration of the second-order version for the viscous Burgers equation with uncertain viscosity coefficient is first given in detail, under different deterministic initial conditions; the attainment of the theoretically expected convergence rate is demonstrated empirically; results and features of our scheme are discussed. We then extend the SFV-ADER method to a non-linear hyperbolic system with source terms that models one-dimensional blood flow in arteries, assuming uncertainties in a set of parameters of the problem. Results are then compared with measurements in a well-defined 1:1 experimental replica of the network of largest arteries in the human systemic circulation. For a 99%-confidence level, severe influence of parameter fluctuations is seen in pressure profiles, while secondary effects on flow rate profiles become visible, particularly in terminal branches. In conclusion, results suggest that the proposed methodology could successfully be applied to other physical problems involving hyperbolic balance laws.

60 APPLIED LIFE SCIENCES↗

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

Overset meshes for incompressible flows: On preserving accuracy of underlying discretizations

This study on overset meshes for incompressible-flow simulations is motivated by accurate prediction of wind farm aerodynamics involving large motions and deformations of components with complex geometry. Specifically, using first-order hyperbolic and elliptic equation proxies for the incompressible Navier-Stokes (NS) equations, we investigate the influence of information exchange between overset meshes on numerical performance where the underlying discretization is second-order accurate. The first aspect of information exchange surrounds interpolation of solution where we examine Lagrange and point-cloud-based interpolation for creating constraint equations between overset meshes. To maintain overall second-order accuracy, higher-order interpolation is required for elliptic problems, but linear interpolation is sufficient for hyperbolic problems in first-order form. Higher-order point-cloud-based interpolation provides a pathway to maintaining accuracy in unstructured meshes, but at higher complexity. The second aspect of information exchange focuses on comparing the approaches of overset single system (OSS) and overset Additive Schwarz (OAS) for coupling the linear systems of the overlapping meshes. While the former involves a single linear system, in the latter the discrete linear systems are solved separately, and solving the global system is accomplished through outer iterations and sequential information exchange in a Jacobi fashion. For the test cases studied, accuracy for hyperbolic problems is maintained by performing two outer iterations, whereas many outer iterations are required for elliptic systems. The order-of-accuracy studies explored here are critical for verifying the overset-mesh coupling algorithms used in engineering simulations. Accuracy of these simulations themselves is, however, quantified using engineering quantities of interest such as drag, power, etc. Consequently, we conclude with numerical experiments using NS equations for incompressible flows where we show that linear interpolation and few outer iterations are sufficient for achieving asymptotic convergence of engineering quantities of interest.

97 MATHEMATICS AND COMPUTING↗

From h to p efficiently: optimal implementation strategies for explicit time-dependent problems using the spectral/ hp element method: FROM h TO p EFFICIENTLY

We investigate the relative performance of a second-order Adams–Bashforth scheme and second-order and fourth-order Runge–Kutta schemes when time stepping a 2D linear advection problem discretised using a spectral/hp element technique for a range of different mesh sizes and polynomial orders. Numerical experiments explore the effects of short (two wavelengths) and long (32 wavelengths) time integration for sets of uniform and non-uniform meshes. The choice of time-integration scheme and discretisation together fixes a CFL limit that imposes a restriction on the maximum time step, which can be taken to ensure numerical stability. The number of steps, together with the order of the scheme, affects not only the runtime but also the accuracy of the solution. Through numerical experiments, we systematically highlight the relative effects of spatial resolution and choice of time integration on performance and provide general guidelines on how best to achieve the minimal execution time in order to obtain a prescribed solution accuracy. The significant role played by higher polynomial orders in reducing CPU time while preserving accuracy becomes more evident, especially for uniform meshes, compared with what has been typically considered when studying this type of problem.

42 ENGINEERING↗

Embedded pairs for optimal explicit strong stability preserving Runge–Kutta methods

We construct a family of embedded pairs for optimal explicit strong stability preserving Runge–Kutta methods of order 2 ≤ p ≤ 4 to be used to obtain numerical solution of spatially discretized hyperbolic PDEs. In this construction, the goals include non-defective property, large stability region, and small error values as defined in Dekker and Verwer (1984) and Kennedy et al. (2000). The new family of embedded pairs offer the ability for strong stability preserving (SSP) methods to adapt by varying the step-size. Through several numerical experiments, we assess the overall effectiveness in terms of work versus precision while also taking into consideration accuracy and stability.

97 MATHEMATICS AND COMPUTING↗

Parallel-In-Time Multigrid with Adaptive Spatial Coarsening for The Linear Advection and Inviscid Burgers Equations

We apply a multigrid reduction-in-time (MGRIT) algorithm to hyperbolic partial differential equations in one spatial dimension. This study is motivated by the observation that sequential time-stepping is a computational bottleneck when attempting to implement highly concurrent algorithms; thus parallel-in-time methods are desirable. MGRIT adds parallelism by using a hierarchy of successively coarser temporal levels to accelerate the solution on the finest level. In the case of explicit time-stepping, spatial coarsening is a suitable approach to ensure that stability conditions are satisfied on all levels, and it may be useful for implicit time-stepping by producing cheaper multigrid cycles. Unfortunately, uniform spatial coarsening results in extremely slow convergence when the wave speed is near zero, even if only locally. We present an adaptive spatial coarsening strategy that addresses this issue for the variable coefficient linear advection equation and the inviscid Burgers equation using first-order explicit or implicit time-stepping methods. Serial numerical results show this method offers significant improvements over uniform coarsening and is convergent for the inviscid Burgers equation with and without shocks. Parallel scaling tests on up to 128K cores indicate that run-time improvements over serial time-stepping strategies are possible when spatial parallelism alone saturates, and that scalability is robust for oscillatory solutions which change on the scale of the grid spacing.

97 MATHEMATICS AND COMPUTING↗

Spectral methods for partial differential equations

Origins of spectral methods, especially their relation to the Method of Weighted Residuals, are surveyed. Basic Fourier, Chebyshev, and Legendre spectral concepts are reviewed, and demonstrated through application to simple model problems. Both collocation and tau methods are considered. These techniques are then applied to a number of difficult, nonlinear problems of hyperbolic, parabolic, elliptic, and mixed type. Fluid dynamical applications are emphasized.

Hussaini, M. Y.↗

Spectral methods for partial differential equations

Origins of spectral methods, especially their relation to the Method of Weighted Residuals, are surveyed. Basic Fourier, Chebyshev, and Legendre spectral concepts are reviewed, and demonstrated through application to simple model problems. Both collocation and tau methods are considered. These techniques are then applied to a number of difficult, nonlinear problems of hyperbolic, parabolic, elliptic, and mixed type. Fluid-dynamical applications are emphasized.

Hussaini, M. Y.↗

Recent applications of spectral methods in fluid dynamics

Origins of spectral methods, especially their relation to the method of weighted residuals, are surveyed. Basic Fourier and Chebyshev spectral concepts are reviewed and demonstrated through application to simple model problems. Both collocation and tau methods are considered. These techniques are then applied to a number of difficult, nonlinear problems of hyperbolic, parabolic, elliptic and mixzed type. Fluid dynamical applications are emphasized.

Zang, T. A.↗

Some insights into the stability of difference approximations for hyperbolic initial-boundary-value problems

This paper states a conjecture which relates Lax-Richmyer stability to the algebraic test of the stability theory of Gustafsson, Kreiss, and Sundstrom (1972), developed for difference approximations to initial boundary value problems where the matrix size J increases linearly with n as n goes to infinity. This corresponds to mesh refinement in both space and time for t = n x delta t = constant.

Warming, Robert F.↗

Fourier analysis of finite element preconditioned collocation schemes

The spectrum of the iteration operator of some finite element preconditioned Fourier collocation schemes is investigated. The first part of the paper analyses one-dimensional elliptic and hyperbolic model problems and the advection-diffusion equation. Analytical expressions of the eigenvalues are obtained with use of symbolic computation. The second part of the paper considers the set of one-dimensional differential equations resulting from Fourier analysis (in the tranverse direction) of the 2-D Stokes problem. All results agree with previous conclusions on the numerical efficiency of finite element preconditioning schemes.

Deville, Michel O.↗

Parallel Multigrid in Time and Space for Extreme-Scale Computational Science

The coming massive parallelism of exascale computing presents a pressing challenge for the many DOE simulations of time-dependent partial differential equations, 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 programmatic interest to DOE, with the goal of enabling scalable simulations of time-dependent hyperbolic and chaotic problems on future architectures.

97 MATHEMATICS AND COMPUTING↗

Specially tailored transfinite-element formulations for hyperbolic heat conduction involving non-Fourier effects

The phenomenon of hyperbolic heat conduction in contrast to the classical (parabolic) form of Fourier heat conduction involves thermal energy transport that propagates only at finite speeds, as opposed to an infinite speed of thermal energy transport. To accommodate the finite speed of thermal wave propagation, a more precise form of heat flux law is involved, thereby modifying the heat flux originally postulated in the classical theory of heat conduction. As a consequence, for hyperbolic heat conduction problems, the thermal energy propagates with very sharp discontinuities at the wave front. Accurate solutions are found for a class of one-dimensional hyperbolic heat conduction problems involving non-Fourier effects that can be used effectively for representative benchmark tests and for validating alternate schemes. Modeling/analysis formulations via specially tailored hybrid computations are provided for accurately modeling the sharp discontinuities of the propagating thermal wave front. Comparative numerical test models are presented for various hyperbolic heat conduction models involving non-Fourier effects to demonstrate the present formulations.

Tamma, Kumar K.↗

First-Order Hyperbolic System Method for Time-Dependent Advection-Diffusion Problems

A time-dependent extension of the first-order hyperbolic system method for advection-diffusion problems is introduced. Diffusive/viscous terms are written and discretized as a hyperbolic system, which recovers the original equation in the steady state. The resulting scheme offers advantages over traditional schemes: a dramatic simplification in the discretization, high-order accuracy in the solution gradients, and orders-of-magnitude convergence acceleration. The hyperbolic advection-diffusion system is discretized by the second-order upwind residual-distribution scheme in a unified manner, and the system of implicit-residual-equations is solved by Newton's method over every physical time step. The numerical results are presented for linear and nonlinear advection-diffusion problems, demonstrating solutions and gradients produced to the same order of accuracy, with rapid convergence over each physical time step, typically less than five Newton iterations.

Mazaheri, Alireza↗

An automatic multigrid method for the solution of sparse linear systems

An automatic version of the multigrid method for the solution of linear systems arising from the discretization of elliptic PDE's is presented. This version is based on the structure of the algebraic system solely, and does not use the original partial differential operator. Numerical experiments show that for the Poisson equation the rate of convergence of our method is equal to that of classical multigrid methods. Moreover, the method is robust in the sense that its high rate of convergence is conserved for other classes of problems: non-symmetric, hyperbolic (even with closed characteristics) and problems on non-uniform grids. No double discretization or special treatment of sub-domains (e.g. boundaries) is needed. When supplemented with a vector extrapolation method, high rates of convergence are achieved also for anisotropic and discontinuous problems and also for indefinite Helmholtz equations. A new double discretization strategy is proposed for finite and spectral element schemes and is found better than known strategies.

Shapira, Yair↗