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 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

High order explicit local time stepping methods for hyperbolic conservation laws

In this paper we present and analyze a general framework for constructing high order explicit local time stepping (LTS) methods for hyperbolic conservation laws. In particular, we consider the model problem discretized by Runge-Kutta discontinuous Galerkin (RK-DG) methods and design LTS algorithms based on the strong stability preserving Runge-Kutta (SSP-RK) schemes, that allow spatially variable time step sizes to be used for time integration in different regions of the computational domain. The proposed algorithms are of predictor-corrector type, in which the interface information along the time direction is first predicted based on the SSP-RK approximations and Taylor expansions, and then the fluxes over the region of the interface are corrected to conserve mass exactly at each time step. Following the proposed framework, we detail the corresponding LTS schemes with accuracy up to the fourth order, and prove their conservation property and nonlinear stability for the scalar conservation laws. Numerical experiments are also presented to demonstrate excellent performance of the proposed LTS algorithms.

58 GEOSCIENCES↗
DOE OSTI2025

Consistent Second Moment Methods with Scalable Linear Solvers for Radiation Transport

Second moment methods (SMMs) are developed that are consistent with the discontinuous Galerkin spatial discretization of the discrete ordinates (or S\(_N\)) transport equations. The low-order (LO) diffusion system of equations is discretized with fully consistent P\(_1\), local discontinuous Galerkin (LDG), and interior penalty (IP) methods. A discrete residual approach is used to derive SMM correction terms that make each of the LO systems consistent with the high-order discretization. We show that the consistent methods are more accurate and have better solution quality than independently discretized LO systems, that they preserve the diffusion limit, and that the LDG and IP consistent SMMs can be scalably solved in parallel on a challenging, multimaterial benchmark problem.

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 OSTI2023

A robust interface finite element formulation for modeling brittle material failure problems

Abstract Failure of many brittle materials and structures can be modeled using interface‐oriented finite elements combined with intrinsic cohesive zone models. The discontinuous Galerkin (DG) finite element method provides an innovative framework for modeling brittle crack propagation with zero‐thickness interface elements, which can accommodate extrinsic cohesive laws to avoid the artificial compliance required in intrinsic cohesive models. However, robust formulations and implementations of DG methods are critical in alleviating the well‐known convergence issues for both crack nucleation and propagation with reduced instability. This paper presents a robust interface element formulation by modifying the incomplete interior penalty Galerkin (IIPG) method, which successfully avoids the initial element interface penetration across elements that occurs prior to crack nucleation, and thereby greatly reduces the instability issue as cracks open. We further verified and validated our implementation by using a bar tension test and a beam fracturing benchmark. The robustness of our proposed interface element method was demonstrated by a micromechanics fiber/matrix debonding problem with 64 fibers embedded in a bulk matrix.

Liu, Ruijie↗
DOE OSTI2022

An IIPG-based finite element framework in MOOSE for modeling fiber reinforced composite failure governed by extrinsic cohesive laws

Fiber reinforced composites (FRC) are widely applied to many important engineering structures such as silicon carbide ceramic matrix composite (SiC CMC) of nuclear fuel claddings. Many material and structure failures are initiated at the interface between two distinctive materials, such as the debonding of interfaces of matrix/fiber of composites or bulk matrix/inclusion in metals at micro-scales. Accurate and robust modeling of these interface failures is critical to the development of novel material and structure with improved functionality. This paper presents a discontinuous Galerkin (DG) finite element method based on the Incomplete Interior Penalty scheme and its implementation in MOOSE for modeling material interface behaviors. The proposed method naturally accommodates important extrinsic cohesive zone material models and is capable of modeling the failures of material interfaces across which material properties are highly distinctive. We demonstrate a good performance of the proposed method using single fiber and multiple fiber debonding problems.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2022

An efficient high-order numerical solver for diffusion equations with strong anisotropy

In this paper, we present an interior penalty discontinuous Galerkin finite element scheme for solving diffusion problems with strong anisotropy arising in magnetized plasmas for fusion applications. Additionally, we demonstrate the accuracy produced by the high-order scheme and develop an efficient preconditioning technique to solve the corresponding linear system, which is robust to the mesh size and anisotropy of the problem. Several numerical tests are provided to validate the accuracy and efficiency of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Enhancements to Overset Methods for Achieving Higher Accuracy and Solution Convergence: Preprint

Overset methods, when utilized within a multi-solver framework, provide a very flexible and powerful toolset for analyzing moving body problem. However, many overset framework suffer from several deficiencies such as (1) convergence degradation of the non-linear iterative schemes (2) difficulty in achieving higher-order accuracy and (3) high computational costs over long simulation times. In this work, we explore approaches that mitigate these deficiencies and provide a pathway for improved accuracy and fidelity of overset methods. A high-order, discontinuous Galerkin solver is integrated into an existing overset framework and applied to an unsteady ROBIN fuselage case. For convergence acceleration, an Overset-GMRES linear solver with a timestep controller is applied to a DLR-F6 aircraft steady simulation and an unsteady, notional rotor-fuselage. Finally the same rotor-fuselage case as well as the JVX rotor/wing case is simulated using a reduced-order aerodynamic model.

aerospace↗
DOE OSTI2021

Entropy stable modal discontinuous Galerkin schemes and wall boundary conditions for the compressible Navier-Stokes equations

Entropy stable schemes ensure that physically meaningful numerical solutions also satisfy a semi-discrete entropy inequality under appropriate boundary conditions. Here in this work, we describe a discretization of viscous terms in the compressible Navier-Stokes equations which enables a simple and explicit imposition of entropy stable no-slip and reflective (symmetry) wall boundary conditions for discontinuous Galerkin (DG) discretizations. Specifically, we derive methods for imposing adiabatic no-slip and reflective (symmetry) boundary conditions for modal entropy stable DG formulations which preserve a semi-discrete entropy inequality. Numerical results confirm the robustness and accuracy of the proposed approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
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 OSTI2023

An implicit-in-time DPG formulation of the 1D1V Vlasov-Poisson equations

Efficient solution of the Vlasov equation, which can be up to six-dimensional, is key to the simulation of many difficult problems in plasma physics. The discontinuous Petrov-Galerkin (DPG) finite element methodology provides a framework for the development of stable (in the sense of Ladyzhenskaya–Babuška–Brezzi conditions) finite element formulations, with built-in mechanisms for adaptivity. While DPG has been studied extensively in the context of steady-state problems and to a lesser extent with space-time discretizations of transient problems, relatively little attention has been paid to time-marching approaches. In the present work, we study a first application of time-marching DPG to the Vlasov equation, using backward Euler for a Vlasov-Poisson discretization. We demonstrate adaptive mesh refinement for two problems: the two-stream instability problem, and a cold diode problem. Furthermore, we believe the present work is novel both in its application of unstructured adaptive mesh refinement (as opposed to block-structured adaptivity, which has been studied previously) in the context of Vlasov-Poisson, as well as in its application of DPG to the Vlasov-Poisson system. We also discuss extensive additions to the Camellia library in support of both the present formulation as well as extensions to higher dimensions, Maxwell equations, and space-time formulations.

97 MATHEMATICS AND COMPUTING↗
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↗
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↗
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↗