Search NASA⌕ Search

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.

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

100 records · Page 6
All sourcesNASA NTRSDOE OSTI
DOE OSTI2023

Adaptive Angular Quadrature Scheme for a backwards-in-time Method of Characteristics Solution to the Radiative Transfer Equation [Slides]

Radiative transfer/radiation transport are important problems to solve in astrophysics and high energy density physics. Various methods exist to solve radiation transport, such as Monte Carlo (MC), Discrete Ordinates (S N ), Method of Characteristics (MOC), and the spherical harmonics (P N ) method. Method of Characteristics requires “launching” of rays in discrete directions. Unresolved details of angular mesh create ray effects and can miss sources in the domain. Ray effects can lead to unphysical “stepping” in solution and incorrect energy deposition. Adaptive quadrature schemes can be used to detect and mitigate these effects. The Method of Characteristics (MOC) is a common method for solving hyperbolic PDEs in radiation transport and supersonic flow problems. Generally in MOC for radiation transport, virtual particles are tracked from birth to the end of a timestep. This requires interpolation to go from final location to cell averaged or corner values of angular intensity. Backwards-in-Time (BIT) particle tracking avoids this by prescribing the final position of the virtual particle at the cell nodes/corners. Angular intensities are computed at time k + 1 by launching ray back to previous timestep(s), or t = 0. Scheme allows solution to be computed as the characteristic ray is traced backwards in time.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2023

Asymptotic vacuum solution at tokamak X-point tip

In the H-mode regime of diverted tokamaks, the presence of strong pressure gradients in the pedestal gives rise to a sizable bootstrap current, together with the Ohmic and Pfirsch–Schlueter currents, close to the separatrix. For such equilibria, the presence of finite current density close to the separatrix requires the reexamination of equilibrium properties. It is almost universally assumed that the two branches of the separatrix (the stable and unstable manifolds) are straight as they cross at the X-point. However, the opposite angles of the plasma-filled segment and vacuum one cannot be equal if the current density does not vanish at the separatrix on the plasma side. We solve this difficulty by chipping off a thin layer of plasma edge so that the sharp corner of the plasma-filled segment becomes a hyperbola. Using the conformal transformation, we found that in the assumption of a hyperbolic boundary, the X point moves beyond the plasma boundary to fall in the vacuum region. An acute angle of the plasma-filled segment leads to an obtuse opposite angle of vacuum segment and vice versa. In the case of an acute angle of the plasma-filled segment, the new X point shifts inside the X point formed by the asymptotes of a hyperbolic boundary; in the case of an obtuse angle of the plasma-filled segment, the new X point shifts outside the X point formed by the asymptotes of a hyperbolic plasma boundary. Furthermore, the results are important for understanding the X point features, which affect the tokamak edge stability and transport.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2025

Spectrally Stabilized Interface Capturing Formulation and Implementation in Nek5000/NekRS

This report documents the formulation of a novel level-set method for incompressible two-phase flows in the continuous Galerkin (CG) high order spectral element framework. The overall method hinges on a novel implementation of the spectral vanishing viscosity (SVV) operator for the stabilization of linear/non-linear hyperbolic problems. The multidimensional SVV convolution kernels, which in essence, have a similar effect as a high pass filter applied to the derivatives, are formulated by exploiting the tensor product form, analogous to the construction of the usual stiffness matrix system. The resulting kernels are directionally decoupled and ensure a linear, symmetric positive definite, elliptic matrix operator. The SVV formulation is demonstrated to provide a robust stabilizing mechanism through challenging linear and non-linear hyperbolic problems, including problems pertinent to the level-set formulation. The two-phase framework conceptualized herein is based on the conservative level-set (CLS) method which represents the interface between the fluids by the 0.5 iso-contour of the smoothed Heaviside function. The CLS method is augmented with a preconditioning procedure for interface normals using the signed distance function which precludes the manifestation of spurious oscillations in the vicinty of the interface. Further, the existing mixed explicit-implicit approach for the solution of Navier-Stokes equations in Nek5000, as described in Tomboulides et al, is augmented with a pressure coefficient splitting approach for the Poisson equation, which greatly accelerated the convergence of pressure solver for two-phase systems with large density ratio. The robustness and accuracy of the overall two-phase method is demonstrated through canonical challenging problems involving high density and viscosity ratios, with and without surface tension. The two-phase formulation is wholly implemented in Nek5000 and the SVV stabilization method is implemented in NekRS, which is the essential precursor to the two-phase framework, undergoing active development.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

A unified hp-HDG framework for Friedrichs' PDE systems

Here, this work proposes a unified hp-adaptivity framework for hybridized discontinuous Galerkin (HDG) method for a large class of partial differential equations (PDEs) of Friedrichs' type. In particular, we present unified hp-HDG formulations for abstract one-field and two-field structures and prove their well-posedness. In order to handle non-conforming interfaces we simply take advantage of HDG built-in mortar structures. With split-type mortars and the approximation space of trace, a numerical flux can be derived via Godunov approach and be naturally employed without any additional treatment. As a consequence, the proposed formulations are parameter-free. We perform several numerical experiments for time-independent and linear PDEs including elliptic, hyperbolic, and mixed-type to verify the proposed unified hp-formulations and demonstrate the effectiveness of hp-adaptation. Two adaptivity criteria are considered: one is based on a simple and fast error indicator, while the other is rigorous but more expensive using an adjoint-based error estimate. The numerical results show that these two approaches are comparable in terms of convergence rate even for problems with strong gradients, discontinuities, and singularities.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Higher-order LaSDI: Reduced order modeling with multiple time derivatives

Solving complex partial differential equations (PDEs) is essential across scientific disciplines but often requires numerical models that can be prohibitively expensive in time-sensitive applications. Reduced-order models (ROMs) address this challenge by exploiting low-dimensional structure to create fast approximations. The Latent Space Dynamics Identification (LaSDI) framework has demonstrated success in learning ROMs for parameterized PDE families, but remains limited to first-order systems. Here, in this paper, we propose Higher-Order LaSDI (HLaSDI), which extends the LaSDI framework to PDEs with arbitrary order of time derivatives. This generalization significantly expands the applicability of LaSDI-based methods to systems previously outside their scope, including hyperbolic PDEs. We demonstrate HLaSDI’s accuracy and efficiency on several linear and nonlinear benchmark problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

AIR Algebraic Multigrid for a Space-Time Hybridizable Discontinuous Galerkin Discretization of Advection(-Diffusion)

This article investigates the efficiency, robustness, and scalability of approximate ideal restriction (AIR) algebraic multigrid as a preconditioner in the all-at-once solution of a space-time hybridizable discontinuous Galerkin discretization of advection-dominated flows. The motivation for this study is that the time-dependent advection-diffusion equation can be seen as a “steady” advection-diffusion problem in $(d+1)$-dimensions and AIR has been shown to be a robust solver for steady advection-dominated problems. Numerical examples demonstrate the effectiveness of AIR as a preconditioner for advection-diffusion problems on fixed and time-dependent domains, using both slab-by-slab and all-at-once space-time discretizations, and in the context of uniform and space-time adaptive mesh refinement. A closer look at the geometric coarsening structure that arises in AIR also explains why AIR can provide robust, scalable, space-time convergence on advective and hyperbolic problems, while most multilevel parallel-in-time schemes struggle with such problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Sparse invariant domain preserving discontinuous Galerkin methods with subcell convex limiting

In this paper, we develop high-order nodal discontinuous Galerkin (DG) methods for hyperbolic conservation laws that satisfy invariant domain preserving properties using subcell flux corrections and convex limiting. These methods are based on a subcell flux corrected transport (FCT) methodology that involves blending a high-order target scheme with a robust, low-order invariant domain preserving method that is obtained using a graph viscosity technique. Furthermore, the new low-order discretizations are based on sparse stencils which do not increase with the polynomial degree of the high-order DG method. As a result, the accuracy of the low-order method does not degrade when used with high-order target methods. The method is applied to both scalar conservation laws, for which the discrete maximum principle is naturally enforced, and to systems of conservation laws such as the Euler equations, for which positivity of density and a minimum principle for specific entropy are enforced. Numerical results are presented on a number of benchmark test cases.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Plasma thermal transport with a generalized 8-moment distribution function

Moment equations that model plasma transport require an ansatz distribution function to close the system of equations. The resulting transport is sensitive to the specific closure used, and several options have been proposed in the literature. Two different 8-moment distribution functions can be generalized to form a single-parameter family of distribution functions. The transport coefficients resulting from this generalized distribution function can be expressed in terms of this free parameter. This provides the flexibility of matching the 8-moment model to some validating result at a given magnetization value, such as Braginskii’s transport, or the more recent results of Davies et al. [Physics of Plasma, 28, 012305 (2021)]. Here, this process can be thought of as solving for the 8-moment distribution function that matches the value of a transport coefficient given by a Chapman-Enskog expansion, while retaining the improved physical properties, such as finite propagation speeds and time dependence which belong to the hyperbolic moment models. Since the presented generalized distribution function only has a single free parameter, only a single transport coefficient can be matched at a time. However, this generalization process may be extended to provide multiple free parameters. The focus of this Brief Communication is on the dramatically improved thermal conductivity of the proposed model compared to the two base moment models.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

Fast Solution of Fully Implicit Runge--Kutta and Discontinuous Galerkin in Time for Numerical PDEs, Part I: the Linear Setting

Fully implicit Runge--Kutta (IRK) methods have many desirable properties as time integration schemes in terms of accuracy and stability, but high-order IRK methods are not commonly used in practice with numerical PDEs due to the difficulty of solving the stage equations. This paper introduces a theoretical and algorithmic preconditioning framework for solving the systems of equations that arise from IRK methods applied to linear numerical PDEs (without algebraic constraints). Additionally, this framework also naturally applies to discontinuous Galerkin discretizations in time. Under quite general assumptions on the spatial discretization that yield stable time integration, the preconditioned operator is proven to have condition number bounded by a small, order-one constant, independent of the spatial mesh and time-step size, and with only weak dependence on number of stages/polynomial order; for example, the preconditioned operator for 10th-order Gauss IRK has condition number less than two, independent of the spatial discretization and time step. The new method can be used with arbitrary existing preconditioners for backward Euler-type time-stepping schemes and is amenable to the use of three-term recursion Krylov methods when the underlying spatial discretization is symmetric. The new method is demonstrated to be effective on various high-order finite-difference and finite element discretizations of linear parabolic and hyperbolic problems, demonstrating fast, scalable solution of up to 10th-order accuracy. The new method consistently outperforms existing block preconditioning approaches, and in several cases, the new method can achieve 4th-order accuracy using Gauss integration with roughly half the number of preconditioner applications and wallclock time as required using standard diagonally IRK methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Implicit fast sweeping method for hyperbolic systems of conservation laws

Implicit time-accurate methods are often used to integrate stiff problems where explicit schemes impose severe time step restrictions. This paper presents an efficient numerical framework based on the Fast Sweeping Method (FSM) for solving linear and nonlinear hyperbolic systems of conservation laws. The solution at each discrete location is computed by sweeping the numerical domain in several predetermined directions that follow the causality of the characteristic families. The use of a fractional step strategy eliminates the need for a solution selection criterion while one-sided stencils limit the number of sweeps to at most 2 d for d space dimensions. This work focuses on the first-order implicit upwind method since it constitutes the building block for high-order conservative schemes. For problems where the degree of stiffness evolves over time, implicit-explicit hybridization can be accomplished with the same algorithm by simply switching the stencil at each time level. As opposed to traditional implicit solvers, the sweeping method does not require a local time linearization of the fluxes thereby preserving the nonlinear stability properties of the original implicit scheme. It also avoids the large computational and memory requirements associated with solving large block-diagonal systems of equations. Here, a series of one- and two-dimensional test cases are presented for the inviscid Burgers' equation and the reactive Euler equations. The results indicate that the implicit FSM can allow a major reduction in the number of time steps even in the presence of discontinuous solution profiles.

74 ATOMIC AND MOLECULAR PHYSICS↗