Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Simulating magnetized neutron stars with discontinuous Galerkin methods

Discontinuous Galerkin methods are popular because they can achieve high order where the solution is smooth, because they can capture shocks while needing only nearest-neighbor communication, and because they are relatively easy to formulate on complex meshes. We perform a detailed comparison of various limiting strategies presented in the literature applied to the equations of general relativistic magnetohydrodynamics. We compare the standard minmod /ΛΠ N limiter, the hierarchical limiter of Krivodonova, the simple WENO limiter, the HWENO limiter, and a discontinuous Galerkin-finite-difference hybrid method. The ultimate goal is to understand what limiting strategies are able to robustly simulate magnetized Tolman-Oppenheimer-Volkoff stars without any fine-tuning of parameters. Among the limiters explored in the paper, the only limiting strategy we can endorse is a discontinuous Galerkin-finite-difference hybrid method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

A greedy Galerkin method to efficiently select sensors for linear dynamical systems

A key challenge in inverse problems is the selection of sensors to gather the most effective data. In this paper, we consider the problem of inferring the initial condition to a linear dynamical system and develop an efficient control-theoretical approach for greedily selecting sensors. Our method employs a Galerkin projection to reduce the size of the inverse problem, resulting in a computationally efficient algorithm for sensor selection. As a byproduct of our algorithm, we obtain a preconditioner for the inverse problem that enables the rapid recovery of the initial condition. Here, we analyze the theoretical performance of our greedy sensor selection algorithm as well as the performance of the associated preconditioner. Finally, we verify our theoretical results on various inverse problems involving partial differential equations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

The Adjoint Petrov–Galerkin method for non-linear model reduction

Here, we formulate a new projection-based reduced-order modeling technique for non-linear dynamical systems. The proposed technique, which we refer to as the Adjoint Petrov–Galerkin (APG) method, is derived by decomposing the generalized coordinates of a dynamical system into a resolved coarse-scale set and an unresolved fine-scale set. A Markovian finite memory assumption within the Mori–Zwanzig formalism is then used to develop a reduced-order representation of the coarse scales. This procedure leads to a closed reduced-order model that displays commonalities with the adjoint stabilization method used in finite elements. The formulation is shown to be equivalent to a Petrov–Galerkin method with a non-linear, time-varying test basis, thus sharing some similarities with the Least-Squares Petrov–Galerkin method. Theoretical analysis examining a priori error bounds and computational cost is presented. Numerical experiments on the compressible Navier–Stokes equations demonstrate that the proposed method can lead to improvements in numerical accuracy, robustness, and computational efficiency over the Galerkin method on problems of practical interest. Improvements in numerical accuracy and computational efficiency over the Least-Squares Petrov–Galerkin method are observed in most cases.

42 ENGINEERING↗
DOE OSTI2024

Robust 3D multi-material hydrodynamics using discontinuous Galerkin methods

A high-order discontinuous Galerkin (DG) method is presented for nonequilibrium multi-material (m ≥ 2) flow with sharp interfaces. Material interfaces are reconstructed using the algebraic THINC approach, resulting in a sharp interface resolution. The system assumes stiff velocity relaxation and pressure nonequilibrium. The presented DG method uses Dubiner's orthogonal basis functions on tetrahedral elements. This results in a unique combination of sharp multimaterial interfaces and high-order accurate solutions in smooth single-material regions. A novel shock indicator based on the interface conservation condition is introduced to mark regions with discontinuities. Slope limiting techniques are applied only in these regions so that nonphysical oscillations are eliminated while maintaining high-order accuracy in smooth regions. A local projection is applied on the limited solution to ensure discrete closure law preservation. The effectiveness of this novel limiting strategy is demonstrated for complex three-dimensional multi-material problems, where robustness of the method is critical. The presented numerical problems demonstrate that more accurate and efficient multi-material solutions can be obtained by the DG method, as compared to second-order finite volume methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Online Adaptive Algorithm for Constraint Energy Minimizing Generalized Multiscale Discontinuous Galerkin Method

Here in this research, we propose an online basis enrichment strategy within the framework of a recently developed constraint energy minimizing generalized multiscale discontinuous Galerkin method. Combining the technique of oversampling, one makes use of the information of the current residuals to adaptively construct basis functions in the online stage to reduce the error of multiscale approximation. A complete analysis of the method is presented, which shows the proposed online enrichment leads to a fast convergence from multiscale approximation to the fine-scale solution. The error reduction can be made sufficiently large by suitably selecting oversampling regions and the number of oversampling layers. Further, the convergence rate of the enrichment algorithm depends on a factor of exponential decay regarding the number of oversampling layers and a user-defined parameter. Numerical results are provided to demonstrate the effectiveness and efficiency of the proposed online adaptive algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A Continuous-Discontinuous Galerkin Method for Electromagnetic Simulations Based on an All-Frequency Stable Formulation

In this paper, a potential-based partial-differential formulation, called the all-frequency stable formulation, is presented for the accurate and robust simulation of electromagnetic problems at all frequencies. Due to its stability from (near) dc to microwave frequencies, this formulation can be applied to simulate wide-band and multiscale problems without encountering the infamous low-frequency breakdown issue or applying basis function decompositions such as the tree-cotree splitting technique. To provide both efficient and flexible numerical solutions to the electromagnetic formulation, a mixed continuous-discontinuous Galerkin (CDG) method is proposed and implemented. In regions with homogeneous media, the continuous Galerkin method is employed to avoid the introduction of duplicated degrees of freedom (DoFs) on the elemental interfaces, while on the interfaces of two different media, the discontinuous Galerkin method is applied to permit the jump of the normal components of the electromagnetic fields. Numerical examples are provided to validate and demonstrate the proposed numerical solver for problems in a wide electromagnetic spectrum.

Yan, Su↗
DOE OSTI2024

Physics-preserving enriched Galerkin method for a fully-coupled thermo-poroelasticity model

This paper proposes a new numerical method for a fully-coupled, quasi-static thermo-poroelasticity model in a unified enriched Galerkin (EG) method framework. In our method, the mechanics sub-problem is solved using a locking-free EG method, and the flow and heat sub-problems are solved using a locally-conservative EG method. The proposed method offers mass and energy conservation properties with much lower costs than other methods with the same properties, including discontinuous Galerkin methods and mixed finite element methods. The well-posedness and optimal a priori error estimates are carefully derived. Here, several numerical tests confirm the theoretical optimal convergence rates and the mass and energy conservation properties of the new method.

15 GEOTHERMAL ENERGY↗
DOE OSTI2024

Hybridized Discontinuous Galerkin Methods for Computational Fluid Dynamics

Hybridizable Discontinuous Galerkin (HDG) methods hold promise for any applications with significant advection character, including thermal hydraulics in light water reactors and advanced reactor concepts and fluid models of plasmas in magnetic confinement fusion. Its features include natural upwinding, local element conservation, and extensibility to arbitrarily high order accuracy. In the last fiscal year we have implemented HDG in the Multiphysics Object-Oriented Simulation Environment (MOOSE). We developed a first-of-its-kind automatic static condensation system in MOOSE’s underlying finite element library libMesh which can condense out arbitrarily many internal variables. Finally, we developed the first preconditioner for HDG discretizations of the Navier-Stokes equations which shows robust performance across a wide range of problem sizes and Reynolds numbers. This preconditioner yields solution times that are equivalent to the fastest developed for industry standard finite volume methods. Moreover, the arbitrarily high-order nature of HDG makes it a prime candidate for acceleration via graphical processing units (GPUs). We believe these developments will hold significant importance for future DOE Nuclear Energy (NE) and Fusion Energy Science (FES) programs.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Energy conserving and well-balanced discontinuous Galerkin methods for the Euler–Poisson equations in spherical symmetry

ABSTRACT This paper presents high-order Runge–Kutta (RK) discontinuous Galerkin methods for the Euler–Poisson equations in spherical symmetry. The scheme can preserve a general polytropic equilibrium state and achieve total energy conservation up to machine precision with carefully designed spatial and temporal discretizations. To achieve the well-balanced property, the numerical solutions are decomposed into equilibrium and fluctuation components that are treated differently in the source term approximation. One non-trivial challenge encountered in the procedure is the complexity of the equilibrium state, which is governed by the Lane–Emden equation. For total energy conservation, we present second- and third-order RK time discretization, where different source term approximations are introduced in each stage of the RK method to ensure the conservation of total energy. A carefully designed slope limiter for spherical symmetry is also introduced to eliminate oscillations near discontinuities while maintaining the well-balanced and total-energy-conserving properties. Extensive numerical examples – including a toy model of stellar core collapse with a phenomenological equation of state that results in core bounce and shock formation – are provided to demonstrate the desired properties of the proposed methods, including the well-balanced property, high-order accuracy, shock-capturing capability, and total energy conservation.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2021

An efficient reconstruction algorithm for diffusion on triangular grids using the nodal discontinuous Galerkin method

High-energy-density (HED) hydrodynamics studies such as those relevant to inertial confinement fusion and astrophysics require highly disparate densities, temperatures, viscosities, and other diffusion parameters over relatively short spatial scales. This presents a challenge for high-order accurate methods to effectively resolve the hydrodynamics at these scales, particularly in the presence of highly disparate diffusion. A significant volume of engineering and physics applications use an unstructured discontinuous Galerkin (DG) method developed based on the finite element mesh generation and algorithmic framework. This work discusses the application of an affine reconstructed nodal DG method for unstructured grids of triangles. Solving the diffusion terms in the DG method is non-trivial due to the solution representations being piecewise continuous. Hence, the diffusive flux is not defined on the interface of elements. The proposed numerical approach reconstructs a smooth solution in a parallelogram that is enclosed by the quadrilateral formed by two adjacent triangle elements. The interface between these two triangles is the diagonal of the enclosed parallelogram. Similar to triangles, the mapping of parallelograms from a physical domain to a reference domain is an affine mapping, which is necessary for an accurate and efficient implementation of the numerical algorithm. Thus, all computations can still be performed on the reference domain, which promotes efficiency in computation and storage. This reconstruction does not make assumptions on choice of polynomial basis. Reconstructed DG algorithms have previously been developed for modal implementations of the convection–diffusion equations. However, to the best of the authors’ knowledge, this is the first practical guideline that has been proposed for applying the reconstructed algorithm on a nodal discontinuous Galerkin method with a focus on accuracy and efficiency. As a result, the algorithm is demonstrated on a number of benchmark cases as well as a challenging substantive problem in HED hydrodynamics with highly disparate diffusion parameters.

Computational efficiency↗
DOE OSTI2020

A discontinuous Galerkin method for general relativistic hydrodynamics in thornado

Discontinuous Galerkin (DG) methods provide a means to obtain high-order accurate solutions in regions of smooth fluid flow while still resolving strong shocks. These and other properties make DG methods attractive for solving problems involving hydrodynamics; e.g., the core-collapse supernova problem. With that in mind we are developing a DG solver for the general relativistic, ideal hydrodynamics equations under a 3+1 decomposition of spacetime, assuming a conformally-flat approximation to general relativity. With the aid of limiters we verify the accuracy and robustness of our code with several difficult test-problems: a special relativistic Kelvin-Helmholtz instability problem, a two-dimensional special relativistic Riemann problem, and a one- and two-dimensional general relativistic standing accretion shock (SAS) problem. We find good agreement with published results, where available. We also establish sufficient resolution for the 1D SAS problem and find encouraging results regarding the standing accretion shock instability (SASI) in 2D.

Dunham, Samuel↗
DOE OSTI2024

Continuously bounds-preserving discontinuous Galerkin methods for hyperbolic conservation laws

For finite element approximations of transport phenomena, it is often necessary to apply a form of limiting to ensure that the discrete solution remains well-behaved and satisfies physical constraints. However, these limiting procedures are typically performed at discrete nodal locations, which is not sufficient to ensure the robustness of the scheme when the solution must be evaluated at arbitrary locations (e.g., for adaptive mesh refinement, remapping in arbitrary Lagrangian–Eulerian solvers, overset meshes, etc.). In this work, a novel limiting approach for discontinuous Galerkin methods is presented which ensures that the solution is continuously bounds-preserving (i.e., across the entire solution polynomial) for any arbitrary choice of basis, approximation order, and mesh element type. Through a modified formulation for the constraint functionals, the proposed approach requires only the solution of a single spatial scalar minimization problem per element for which a highly efficient numerical optimization procedure is presented. Here, the efficacy of this approach is shown in numerical experiments by enforcing continuous constraints in high-order unstructured discontinuous Galerkin discretizations of hyperbolic conservation laws, ranging from scalar transport with maximum principle preserving constraints to compressible gas dynamics with positivity-preserving constraints.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Multiscale Modeling Framework Using Element‐Based Galerkin Methods for Moist Atmospheric Limited‐Area Simulations

This paper presents a multiscale modeling framework (MMF) to model moist atmospheric limited-area weather. The MMF resolves large-scale convection using a coarse grid while simultaneously resolving local features through numerous fine local grids and coupling them seamlessly. Both large- and small-scale processes are modeled using the compressible Navier-Stokes equations within the Nonhydrostatic Unified Model of the Atmosphere (NUMA), and are discretized using a continuous element-based Galerkin method (spectral elements) with high-order basis functions. Consequently, the large-scale and small-scale models share the same dynamical core but have the flexibility to be adjusted individually. The proposed MMF method is tested in 2D and 3D idealized limited-area weather problems involving storm clouds produced by squall line and supercell simulations. Numerical results from the MMF showed enhanced representation of cloud processes compared to the coarse model.

Kang, Soonpil [Naval Postgraduate School, Monterey↗
DOE OSTI2024

An Asymptotic Preserving Discontinuous Galerkin Method for a Linear Boltzmann Semiconductor Model

A key property of the linear Boltzmann semiconductor model is that as the collision frequency tends to infinity, the phase space density $f$ = $f$ ($x, v, t$) converges to an isotropic function $M (v)$$ρ$$(x, t)$, called the drift-diffusion limit, where $M$ is a Maxwellian and the physical density $ρ$ satisfies a second-order parabolic PDE known as the drift-diffusion equation. Numerical approximations that mirror this property are said to be asymptotic preserving. In this paper we build a discontinuous Galerkin method to the semiconductor model, and we show this scheme is both uniformly stable in $ε$, where 1/$ε$ is the scale of the collision frequency, and asymptotic preserving. Here in particular, we discuss what properties the discrete Maxwellian must satisfy in order for the schemes to converge in $ε$ to an accurate $h$-approximation of the drift-diffusion limit. Discrete versions of the drift-diffusion equation and error estimates in several norms with respect to $ε$ and the spacial resolution are also included.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

An adaptive discontinuous Petrov-Galerkin method for the Grad-Shafranov equation

In this work, we propose and develop an arbitrary-order adaptive discontinuous Petrov--Galerkin (DPG) method for the nonlinear Grad--Shafranov equation. An ultraweak formulation of the DPG scheme for the equation is given based on a minimal residual method. The DPG scheme has the advantage of providing more accurate gradients compared to conventional finite element methods, which is desired for numerical solutions to the Grad--Shafranov equation. The numerical scheme is augmented with an adaptive mesh refinement approach, and a criterion based on the residual norm in the minimal residual method is developed to achieve dynamic refinement. Nonlinear solvers for the resulting system are explored and a Picard iteration with Anderson acceleration is found to be efficient to solve the system. Finally, the proposed algorithm is implemented in parallel on MFEM using a domain-decomposition approach, and our implementation is general, supporting arbitrary order of accuracy and general meshes. Furthermore, numerical results are presented to demonstrate the efficiency and accuracy of the proposed algorithm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Low-Memory, Discrete Ordinates, Discontinuous Galerkin Methods for Radiative Transport

The discrete ordinates discontinuous Galerkin (SN-DG) method is a well-established and practical approach for solving the radiative transport equation. In this paper, we study a low-memory variation of the upwind SN-DG method. The proposed method uses a smaller finite element space that is constructed by coupling spatial unknowns across collocation angles, thereby yielding an approximation with fewer degrees of freedom than the standard method. Like the original SN-DG method, the low-memory variation still preserves the asymptotic diffusion limit and maintains the characteristic structure needed for mesh sweeping algorithms. While we observe second-order convergence in the scattering dominated, diffusive regime, the low-memory method is in general only first-order accurate. To address this issue, we use upwind reconstruction to recover second-order accuracy. Finally, for both methods, numerical procedures based on upwind sweeps are proposed to reduce the system dimension in the underlying Krylov solver strategy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

A short note on the accuracy of the discontinuous Galerkin method with reentrant faces

In this work, we study the convergence of the discontinuous Galerkin (DG) method applied to the advection–reaction equation on meshes with reentrant faces. On such meshes, the upwind numerical flux is not smooth, and so the numerical integration of the resulting face terms can only be expected to be first-order accurate. Despite this inexact integration, we prove that the DG method converges with order $\mathscr{O}$(h p+1/2 ), which is the same rate as in the case of exact integration. Consequently, specialized quadrature rules that accurately integrate the non-smooth numerical fluxes are not required for high-order accuracy. These results are numerically corroborated on examples of linear advection and discrete ordinates transport equations.

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↗