Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “discontinuous Galerkin method”

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 235 records · Page 13
All sourcesNASA NTRSDOE OSTI
NASA NTRS2016

Overview of the NASA Glenn Flux Reconstruction Based High-Order Unstructured Grid Code

A computational fluid dynamics code based on the flux reconstruction (FR) method is currently being developed at NASA Glenn Research Center to ultimately provide a large- eddy simulation capability that is both accurate and efficient for complex aeropropulsion flows. The FR approach offers a simple and efficient method that is easy to implement and accurate to an arbitrary order on common grid cell geometries. The governing compressible Navier-Stokes equations are discretized in time using various explicit Runge-Kutta schemes, with the default being the 3-stage/3rd-order strong stability preserving scheme. The code is written in modern Fortran (i.e., Fortran 2008) and parallelization is attained through MPI for execution on distributed-memory high-performance computing systems. An h- refinement study of the isentropic Euler vortex problem is able to empirically demonstrate the capability of the FR method to achieve super-accuracy for inviscid flows. Additionally, the code is applied to the Taylor-Green vortex problem, performing numerous implicit large-eddy simulations across a range of grid resolutions and solution orders. The solution found by a pseudo-spectral code is commonly used as a reference solution to this problem, and the FR code is able to reproduce this solution using approximately the same grid resolution. Finally, an examination of the code's performance demonstrates good parallel scaling, as well as an implementation of the FR method with a computational cost/degree- of-freedom/time-step that is essentially independent of the solution order of accuracy for structured geometries.

High-Order Methods↗
NASA NTRSDate not supplied

New Capabilities and Improvements to the High-Order Glenn Flux Reconstruction Code

The Glenn Flux Reconstruction (GFR) code is a computational fluid dynamics (CFD) code under development at NASA Glenn Research Center. GFR is based on the high-order flux reconstruction (FR) method and provides a large-eddy simulation (LES) capability that is both accurate and efficient for complex aeropropulsion flows. Three significant new capabilities have been added to the code that improve its performance and functionality. First, a variety of explicit Runge-Kutta methods, including some with adaptive time stepping, were added to GFR with two methods offering a 33% improvement in time-to-solution. Second, GFR can now utilize fully unstructured, mixed-element meshes to more easily facilitate the grid generation process for complex geometries. Finally, a rotating reference frame capability has been added to GFR for solving rotating turbomachinery problems. A selection of results demonstrating these new capabilities are presented in this work. The Taylor-Green vortex problem is used to verify the new unstructured capability by showing similar accuracy and resolution for all element types. LES of the Turbulent Heat Flux Phase III (THX3) experiment with comparison to another high-order LES code and a popular Reynolds-averaged Navier-Stokes (RANS) code demonstrates the accuracy of the code for complex aeropropulsion flows. Finally, LES of a spacecraft cabin ventilation fan shows the ability of GFR to efficiently establish a fan performance map and identify operating points for further analysis at high orders of accuracy.

High-Order Methods↗
DOE OSTI2021

A scalable exponential-DG approach for nonlinear conservation laws: With application to Burger and Euler equations

In this work, we propose an Exponential DG framework for partial differential equations. We decompose 7 governing equations into linear and nonlinear parts to which we apply the discontinuous Galerkin 8 (DG) spatial discretization. In particular, we construct the linear part using Jacobian that effectively 9 capture stiff characteristics in the system. The former is integrated analytically, whereas the latter 10 is approximated. This approach i) is stable with a large Courant number (Cr > 1); ii) supports 11 high-order solutions both in time and space; iii) is computationally favorable compared to IMEX 12 DG methods with no preconditioner; iv) becomes comparable to explicit RKDG methods on uniform 13 mesh and beneficial on non-uniform grid for Euler equations; v) is scalable in a modern massively 14 parallel computing architecture due to its explicit nature of exponential time integrators and com15 pact communication stencil of DG method. Numerical results demonstrate the performance of our 16 proposed methods through various examples. We also discuss the stability and convergence analysis 17 for our exponential DG scheme in the context of Burgers equation.

42 ENGINEERING↗
NASA NTRS2013

High-Order Methods for Computational Fluid Dynamics: A Brief Review of Compact Differential Formulations on Unstructured Grids

Popular high-order schemes with compact stencils for Computational Fluid Dynamics (CFD) include Discontinuous Galerkin (DG), Spectral Difference (SD), and Spectral Volume (SV) methods. The recently proposed Flux Reconstruction (FR) approach or Correction Procedure using Reconstruction (CPR) is based on a differential formulation and provides a unifying framework for these high-order schemes. Here we present a brief review of recent developments for the FR/CPR schemes as well as some pacing items.

Huynh, H. T.↗
DOE OSTI2022

Implicit shock tracking for unsteady flows by the method of lines

Here, a recently developed high-order implicit shock tracking (HOIST) framework for resolving discontinuous solutions of inviscid, steady conservation laws is extended to the unsteady case. Central to the framework is an optimization problem which simultaneously computes a discontinuity-aligned mesh and the corresponding high-order approximation to the flow, which provides nonlinear stabilization and a high-order approximation to the solution. This work extends the implicit shock tracking framework to the case of unsteady conservation laws using a method of lines discretization via a diagonally implicit Runge-Kutta method by “solving a steady problem at each timestep”. We formulate and solve an optimization problem that produces a feature-aligned mesh and solution at each Runge-Kutta stage of each timestep, and advance this solution in time by standard Runge-Kutta update formulas. A Rankine-Hugoniot based prediction of the shock location together with a high-order, untangling mesh smoothing procedure provides a high-quality initial guess for the optimization problem at each time, which results in rapid convergence of the sequential quadratic programing (SQP) optimization solver. This method is shown to deliver highly accurate solutions on coarse, high-order discretizations without nonlinear stabilization and recover the design accuracy of the Runge-Kutta scheme. We demonstrate this framework on a series of inviscid, unsteady conservation laws in both one- and two- dimensions. We also verify that our method is able to recover the design order of accuracy of our time integrator in the presence of a strong discontinuity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

ATDM AD projects to ECP Report (Q3 FY2020)

The SPARC team has completed much of the workflow development needed for the coupled and uncoupled analyses needed to support our flight test validation work. The SPARC team has continued to make progress on development activities to support unsteady, full reentry vehicle aero analysis, which have focused on turbulence modeling, uniform mesh refinement, in-situ visualization (with the Paraview/Catalyst team), and performance analysis. The SPARC team is making solid progress towards our Q4 goal of demonstrating an improved Wall Modeled Large Eddy Simulation (WMLES) capability for standard geometries using high-order finite difference, discontinuous Galerkin, and low-dissipation finite volume methods. The SPARC team has met the minimum completion criteria for parts of the L1, including documenting performance and scaling of SPARC on Trinity, Sierra and Astra, and performing runs for the flight test validation case.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A Scalable Reduced‐Order Model for the Steady Navier–Stokes Equations

Scaling up new scientific technologies from laboratory to industry often involves demonstrating performance on a larger scale. Computer simulations can accelerate design and predictions in the deployment process, though traditional numerical methods are computationally intractable even for intermediate pilot plant scales. Recently, the component reduced order modeling method has been developed to tackle this challenge by combining projection reduced order modeling and discontinuous Galerkin domain decomposition. However, while many scientific or engineering applications involve nonlinear physics, this method has only been demonstrated for various linear systems. In this work, the component reduced order modeling method is extended to steady Navier–Stokes flow, with application to general nonlinear physics in view. The large‐scale, global domain is decomposed into a combination of small‐scale unit component. Linear subspaces for flow velocity and pressure are identified via proper orthogonal decomposition over sample snapshots collected from each small‐scale unit component. Velocity bases are augmented with a pressure supremizer to satisfy the inf–sup condition for stable pressure prediction. Two different nonlinear reduced order modeling methods are employed and compared for efficient evaluation of nonlinear advection: A third‐order tensor projection operator and the empirical quadrature procedure. The proposed method is demonstrated on the flow over arrays of five different unit objects, achieving a 23‐fold speedup with less than 4% relative error in domains up to 256 times larger than the unit components. Furthermore, a numerical experiment with the pressure supremizer strongly indicates the need for a supremizer for stable pressure prediction. A comparison between the tensorial approach and the empirical quadrature procedure revealed a slight advantage of the empirical quadrature procedure. The framework is compared with an alternating Schwarz‐based reduced‐order approach, demonstrating improved efficiency and robustness for the DG‐based global solver while retaining flexibility for sub‐scale iterative solvers. The method is further extended to a coupled advection–diffusion and Navier–Stokes system, illustrating its applicability to multi‐physics problems and its potential for more general, inter‐coupled nonlinear systems.

42 ENGINEERING↗
DOE OSTI2020

Discontinuous Galerkin discretization for quantum simulation of chemistry

All-electron electronic structure methods based on the linear combination of atomic orbitals method with Gaussian basis set discretization offer a well established, compact representation that forms much of the foundation of modern correlated quantum chemistry calculations—on both classical and quantum computers. Despite their ability to describe essential physics with relatively few basis functions, these representations can suffer from a quartic growth of the number of integrals. Recent results have shown that, for some quantum and classical algorithms, moving to representations with diagonal two-body operators can result in dramatically lower asymptotic costs, even if the number of functions required increases significantly. We introduce a way to interpolate between the two regimes in a systematic and controllable manner, such that the number of functions is minimized while maintaining a block-diagonal structure of the two-body operator and desirable properties of an original, primitive basis. Techniques are analyzed for leveraging the structure of this new representation on quantum computers. Empirical results for hydrogen chains suggest a scaling improvement from O(N 4.5 ) in molecular orbital representations to O(N 2.6 ) in our representation for quantum evolution in a fault-tolerant setting, and exhibit a constant factor crossover at 15 to 20 atoms. Moreover, we test these methods using modern density matrix renormalization group methods classically, and achieve excellent accuracy with respect to the complete basis set limit with a speedup of 1–2 orders of magnitude with respect to using the primitive or Gaussian basis sets alone. These results suggest our representation provides significant cost reductions while maintaining accuracy relative to molecular orbital or strictly diagonal approaches for modest-sized systems in both classical and quantum computation for correlated systems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2020

Massively parallel transport sweeps on meshes with cyclic dependencies

When solving the first-order form of the linear Boltzmann equation, a common misconception is that the matrix-free computational method of “sweeping the mesh”, used in conjunction with the Discrete Ordinates method, is too complex or does not scale well enough to be implemented in modern high performance computing codes. This has led to considerable efforts in the development of matrix-based methods that are computationally expensive and is partly driven by the requirements placed on modern spatial discretizations. In particular, modern transport codes are required to support higher order elements, a concept that invariably adds a lot of complexity to sweeps because of the introduction of cyclic dependencies with curved mesh cells. In this article we will present a comprehensive implementation of sweeping, to a piecewise-linear DFEM spatial discretization with particular focus on handling cyclic dependencies and possible extensions to higher order spatial discretizations. We find that these methods are implemented in a new C++ simulation framework called Chi-Tech (). We present some typical simulation results with some performance aspects that one can expect during real world simulations, we also present a scaling study to >100k processes where Chi-Tech maintains greater than 80% efficiency solving a total of 87.7 trillion angular flux unknowns for a 116 group simulation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2022

A scalable DG solver for the electroneutral Nernst-Planck equations

The robust, scalable simulation of flowing electrochemical systems is increasingly important due to the synergy between intermittent renewable energy and electrochemical technologies such as energy storage and chemical manufacturing. The high Péclet regime of many such applications prevents the use of off-the-shelf discretization methods. In this work, we present a high-order Discontinuous Galerkin scheme for the electroneutral Nernst-Planck equations. The chosen charge conservation formulation allows for the specific treatment of the different physics: upwinding for advection and migration, and interior penalty for diffusion of ionic species as well the electric potential. Similarly, the formulation enables different treatments in the preconditioner: AMG for the potential blocks and ILU-based methods for the advection-dominated concentration blocks. Here we evaluate the convergence rate of the discretization scheme through numerical tests. Strong scaling results for two preconditioning approaches are shown for a large 3D flow-plate reactor example.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS2001

SGBEM-FEM Alternating Method for Analyzing 3D Non-Planar Cracks and Their Growth in Structural Components

The highly accurate and efficient Symmetric Galerkin Boundary Element Method (SGBEM), a Finite Element Method (FEM)-based alternating method, is proposed for analyzing three-dimensional non-planar cracks and their growth. The cracks are modeled using the symmetric Galerkin boundary element method as a distribution of displacement discontinuities, simulating an infinite medium. The finite element method only analyzes the stress for the uncracked body. The solution for the cracked structural component is determined by an iteration procedure. This process alternates between an FEM solution for the uncracked body and the SGBEM solution for a crack in an infinite body. Numerical analysis, and the Java code used, evaluate stress intensity factors and model fatigue crack growth. Examples of non-planar cracks in infinite media and planar cracks in finite bodies, as well as growth under fatigue, show the accuracy of the method.

Nikishkov, G. P.↗
DOE OSTI2024

A discontinuous piecewise polynomial generalized moving least squares scheme for robust finite element analysis on arbitrary grids

A variational approach is developed with a meshless discretization to enable accurate and robust numerical simulation of partial differential equations for meshes that are of poor quality. Traditional finite element methods use the mesh to both discretize the geometric domain and to define the finite element shape functions. The latter creates a dependence between the quality of the mesh and the properties of the finite element basis that may adversely affect the accuracy of the discretized problem. Here, we propose a new approach for defining finite element shape functions that breaks this dependence and separates mesh quality from the discretization quality, which we call discontinuous piecewise polynomial generalized moving least squares (DPP-GMLS). At the core of the approach is a meshless definition of the shape functions, which limits the purpose of the mesh to representing the geometric domain and integrating the basis functions without having any role in their approximation quality. The resulting non-conforming space can be utilized within a standard discontinuous Galerkin framework, providing a rigorous foundation for solving partial differential equations on low-quality meshes. We present a collection of numerical experiments demonstrating our approach in a wide range of settings: strongly coercive elliptic problems, linear elasticity in the compressible regime, and the stationary Stokes problem. We demonstrate convergence for all problems and stability for element pairs for problems which usually require inf-sup compatibility for conforming methods, also referring to a minor modification possible through the symmetric interior penalty Galerkin framework for stabilizing element pairs that would otherwise be traditionally unstable. Mesh robustness is particularly critical for elasticity, and we provide an example that our approach provides a greater than 5 x improvement in accuracy and allows for taking an 8 x larger stable timestep for a highly deformed mesh, compared to the continuous Galerkin finite element method.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

A Runge-Kutta discontinuous finite element method for high speed flows

A Runge-Kutta discontinuous finite element method is developed for hyperbolic systems of conservation laws in two space variables. The discontinuous Galerkin spatial approximation to the conservation laws results in a system of ordinary differential equations which are marched in time using Runge-Kutta methods. Numerical results for the two-dimensional Burger's equation show that the method is (p+1)-order accurate in time and space, where p is the degree of the polynomial approximation of the solution within an element and is capable of capturing shocks over a single element without oscillations. Results for this problem also show that the accuracy of the solution in smooth regions is unaffected by the local projection and that the accuracy in smooth regions increases as p increases. Numerical results for the Euler equations show that the method captures shocks without oscillations and with higher resolution than a first-order scheme.

Bey, Kim S.↗
NASA NTRS1981

A Galerkin type finite element method for rotary-wing aeroelasticity in hover and forward flight

A Galerkin finite element method for the spatial discretization of the nonlinear, nonselfadjoint, partial differential equations governing rotary-wing aeroelasticity is presented. This method reduces algebraic manipulative labor significantly when compared to the global Galerkin method based on assumed modes. Furthermore, the Galerkin finite element method is ideally suited to treat rotor blades with discontinuous mass and stiffness distribution and structurally redundant configurations as they appear in bearingless rotors. Implementation of the method is illustrated for the coupled flap-lag aeroelastic problem of hingeless rotor blades in hover and forward flight. Numerical results for stability and response illustrate the numerical properties and convergence behavior of the method. It is concluded that the Galerkin finite element method is a practical tool for solving rotary-wing aeroelastic stability and response problems.

Straub, F. K.↗
DOE OSTI2024

A collision-based hybrid method for the BGK equation

In this article, we apply the collision-based hybrid method introduced by Hauck and McClarren to the Boltzmann equation with the BGK operator and a hyperbolic scaling. An implicit treatment of the source term is used to handle stiffness associated with the BGK operator. Although it helps the numerical scheme become stable with a large time step size, it is still not obvious to achieve the desired order of accuracy due to the relationship between the size of the spatial cell and the mean free path. Without asymptotic preserving property, a very restricted grid size is required to resolve the mean free path, which is not practical. Our approaches are based on the noncollision-collision decomposition of the BGK equation. We introduce the arbitrary order of nodal discontinuous Galerkin (DG) discretization in space with a semi-implicit time-stepping method; we employ the backward Euler time integration for the uncollided equation and the 2nd order predictor-corrector scheme for the collided equation, i.e., both source terms in uncollided and collided equations are treated implicitly and only streaming term in the collided equation is solved explicitly. This improves the computational efficiency without the complexity of the numerical implementation. Numerical results are presented for various Knudsen numbers to present the effectiveness and accuracy of our hybrid method. Also, we compare the solutions of the hybrid and non-hybrid schemes.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2013

ONERA-NASA Cooperative Effort on Liner Impedance Eduction

As part of a cooperation between ONERA and NASA, the liner impedance eduction methods developed by the two research centers are compared. The NASA technique relies on an objective function built on acoustic pressure measurements located on the wall opposite the test liner, and the propagation code solves the convected Helmholtz equation in uniform ow using a finite element method that implements a continuous Galerkin discretization. The ONERA method uses an objective function based either on wall acoustic pressure or on acoustic velocity acquired above the liner by Laser Doppler Anemometry, and the propagation code solves the linearized Euler equations by a discontinuous Galerkin discretization. Two acoustic liners are tested in both ONERA and NASA ow ducts and the measured data are treated with the corresponding impedance eduction method. The first liner is a wire mesh facesheet mounted onto a honeycomb core, designed to be linear with respect to incident sound pressure level and to grazing ow velocity. The second one is a conventional, nonlinear, perforate-over-honeycomb single layer liner. Configurations without and with ow are considered. For the nonlinear liner, the comparison of liner impedance educed by NASA and ONERA shows a sensitivity to the experimental conditions, namely to the nature of the source and to the sample width.

Primus, Julien↗
DOE OSTI2020

A quadratic programming flux correction method for high-order DG discretizations of S transport

In this work, we present a new flux-fixup approach for arbitrarily high-order discontinuous Galerkin (DG) discretizations of the S N transport equation, and we demonstrate the compatibility of this approach with the Variable Eddington Factor (VEF) method. The new fixup approach is sweep-compatible: during a transport sweep (block Gauss-Seidel iteration in which the scattering source is lagged), a local quadratic programming (QP) problem is solved in each spatial element to ensure that the solution satisfies certain physical constraints, including local particle balance. In this paper, we describe two choices of physical constraints, resulting in two variants of the method: QP Zero (QPZ) and QP Maximum Principle (QPMP). In QPZ, the finite element coefficients of the solution are constrained to be nonnegative. In QPMP, they are constrained to adhere to an approximate discrete maximum principle. There are two primary takeaways in this paper. First, when the positive Bernstein basis is used for DG discretization, the QPMP method eliminates negativities, preserves high-order accuracy for smooth problems, and significantly dampens unphysical oscillations in the solution. The latter feature – the dampening of unphysical oscillations – is an improvement upon standard, simpler fixup approaches such as the approach described in (denoted as the “zero and rescale” (ZR) method in this paper). This improvement comes at a moderate computational cost, but it is not prohibitive. Our results show that, even in an unrealistic worst-case scenario where 83% of the spatial elements require a fixup, the computational cost of performing a transport sweep with fixup is only ~31% greater than performing one without fixup. The second takeaway is that the VEF method can be used to accelerate the convergence of transport sweeps even when a fixup is applied. When optically thick regions are present, transport sweeps converge slowly, regardless of whether a fixup is applied, and acceleration is needed. However, attempting to apply standard diffusion synthetic acceleration (DSA) to fixed-up transport sweeps results in divergence for optically thick problems. Our results show that the same is not true for VEF. When VEF is combined with fixed-up transport sweeps, the result is a scheme that produces a nonnegative solution, converges independently of the mean free path, and, in the case of the QPMP fixup, adheres to an approximate discrete maximum principle.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Low-Order Preconditioning for the High-Order Finite Element de Rham Complex

Here, we present a unified framework for constructing spectrally equivalent low-order-refined discretizations for the high-order finite element de Rham complex. This theory covers diffusion problems in H 1 , H(curl), and H(div) and is based on combining a low-order discretization posed on a refined mesh with a high-order basis for Nédélec and Raviart–Thomas elements that makes use of the concept of polynomial histopolation (polynomial fitting using prescribed mean values over certain regions). This spectral equivalence, coupled with algebraic multigrid methods constructed using the low-order discretization, results in highly scalable matrix-free preconditioners for high-order finite element problems in the full de Rham complex. Additionally, a new lowest-order (piecewise constant) preconditioner is developed for high-order interior penalty discontinuous Galerkin (DG) discretizations, for which spectral equivalence results and convergence proofs for algebraic multigrid methods are provided. In all cases, the spectral equivalence results are independent of polynomial degree and mesh size; for DG methods, they are also independent of the penalty parameter. These new solvers are flexible and easy to use; any “black-box” preconditioner for low-order problems can be used to create an effective and efficient preconditioner for the corresponding high-order problem. A number of numerical experiments are presented, based on an implementation in the finite element library MFEM. A range of challenging three-dimensional problems are used to corroborate the theoretical properties and demonstrate the flexibility and scalability of the method.

97 MATHEMATICS AND COMPUTING↗