Search NASA⌕ Search

SEARCH · Search NASA

Results for “Discontinuous Galerkin”

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 37 records · Page 2

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↗

Electromagnetic full-$f$ gyrokinetics in the tokamak edge with discontinuous Galerkin methods

Here, we present an energy-conserving discontinuous Galerkin scheme for the full-f electromagnetic gyrokinetic system in the long-wavelength limit. We use the symplectic formulation and solve directly for ∂A II /∂t, the inductive component of the parallel electric field, using a generalized Ohm’s law derived directly from the gyrokinetic equation. Linear benchmarks are performed to verify the implementation and show that the scheme avoids the Amp`ere cancellation problem. We perform a nonlinear electromagnetic simulation in a helical open-field-line system as a rough model of the tokamak scrape-off layer using parameters from the National Spherical Torus Experiment (NSTX). This is the first published nonlinear electromagnetic gyrokinetic simulation on open field lines. Comparisons are made to a corresponding electrostatic simulation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A moving discontinuous Galerkin finite element method with interface condition enforcement for compressible flows

A variation of moving discontinuous Galerkin finite element method with interface condition enforcement (MDG-ICE) is developed for solving the compressible Euler equations. The MDG-ICE method, originating from the work of Corrigan et al. [1], [2], [3], [4], is based on the space-time DG formulation, where both flow field and grid geometry are considered as independent variables and the conservation laws are enforced both on discrete elements and element interfaces. The element conservation laws are solved in the standard discontinuous solution space to determine conservative quantities, while the interface conservation is enforced using a variational formulation in a continuous space to determine discrete grid geometry. The resulting over-determined system of nonlinear equations arising from the MDG-ICE formulation can then be solved in a least-squares sense, leading to an unconstrained nonlinear least-squares problem that is regularized and solved by Levenberg-Marquardt method. A number of numerical experiments for both 1D unsteady and 2D steady state compressible flow problems are conducted to assess the accuracy and robustness of the MDG-ICE method. Numerical results obtained indicate that the MDG-ICE method is able to implicitly detect and track all types of discontinuities via interface conservation enforcement and satisfy the conservation law on both elements and interfaces via grid movement and grid management, demonstrating that an exponential rate of convergence for Sod and Lax-Harden shock tube problems can be achieved and highly accurate solutions without overheating to both double-rarefaction wave and Noh problems can be obtained.

97 MATHEMATICS AND COMPUTING↗

Uniform Subspace Correction Preconditioners for Discontinuous Galerkin Methods with hp-Refinement

In this paper, we develop subspace correction preconditioners for discontinuous Galerkin (DG) discretizations of elliptic problems with hp-refinement. These preconditioners are based on the decomposition of the DG finite element space into a conforming subspace, and a set of small nonconforming edge spaces. The conforming subspace is preconditioned using a matrix-free low-order refined technique, which in this work, we extend to the hp-refinement context using a variational restriction approach. The condition number of the resulting linear system is independent of the granularity of the mesh h, and the degree of the polynomial approximation p. The method is amenable to use with meshes of any degree of irregularity and arbitrary distribution of polynomial degrees. Furthermore, numerical examples are shown on several test cases involving adaptively and randomly refined meshes, using both the symmetric interior penalty method and the second method of Bassi and Rebay (BR2).

97 MATHEMATICS AND COMPUTING↗

Semi-Lagrangian nodal discontinuous Galerkin method for the BGK model

In this work, we propose a semi-Lagrangian (SL) nodal discontinuous Galerkin (DG) solver for the BGK equation. The BGK model was introduced by Bhatnagar, Gross, and Krook [1] as a relaxation model for the fundamental Boltzmann equation [5], which describes the kinetic dynamic of rarefied gases with a probability distribution function. The challenges of designing efficient numerical schemes for the Boltzmann equation mainly come from its high dimensionality and complicated nonlinear collision operator. The BGK model gains interests since it has much lower computational cost, due to the relatively simple structure of the relaxation operator in replacement of the collision operator, while simultaneously preserving several important physical properties, such as macroscopic quantities and dissipation of entropy.

97 MATHEMATICS AND COMPUTING↗

A reconstructed discontinuous Galerkin method for compressible flows in Lagrangian formulation

In this work, a high-order accurate reconstructed discontinuous Galerkin (rDG) method is developed for solving two-dimensional hydrodynamic problems in cell-centered updated Lagrangian formulation. This method is the Lagrangian limit of the unsplit rDG-ALE formulation, and is obtained by assuming the equality of the grid velocity to the fluid velocity only at cell boundaries. The conservative variables and the Taylor basis defined on the time-dependent moving mesh, provide the piece-wise polynomial expansion in the updated Lagrangian formulation. A multi-directional nodal Riemann solver is implemented for computing the grid velocity at the vertices and the numerical flux at the cell boundaries. A characteristic limiting procedure is extended from the primitive variable version to the conservative variable version, and its performance is compared with the limiter on physical variables. A number of benchmark test cases are conducted to assess the accuracy, robustness, and non-oscillatory property of the DG(P0), DG(P1) and rDG(P1P2) methods. The numerical experiments demonstrate that the developed rDG method is able to attain the designed order of accuracy and the characteristic limiting procedure outperforms the limiter on physical variables in terms of the monotonicity and symmetry preservation for shock problems.

42 ENGINEERING↗

A parallel p ‐adaptive discontinuous Galerkin method for the Euler equations with dynamic load‐balancing on tetrahedral grids

Abstract A novel p ‐adaptive discontinuous Galerkin (DG) method has been developed to solve the Euler equations on three‐dimensional tetrahedral grids. Hierarchical orthogonal basis functions are adopted for the DG spatial discretization while a third order TVD Runge‐Kutta method is used for the time integration. A vertex‐based limiter is applied to the numerical solution in order to eliminate oscillations in the high order method. An error indicator constructed from the solution of order and is used to adapt degrees of freedom in each computational element, which remarkably reduces the computational cost while still maintaining an accurate solution. The developed method is implemented with under the Charm++ parallel computing framework. Charm++ is a parallel computing framework that includes various load‐balancing strategies. Implementing the numerical solver under Charm++ system provides us with access to a suite of dynamic load balancing strategies. This can be efficiently used to alleviate the load imbalances created by p ‐adaptation. A number of numerical experiments are performed to demonstrate both the numerical accuracy and parallel performance of the developed p ‐adaptive DG method. It is observed that the unbalanced load distribution caused by the parallel p ‐adaptive DG method can be alleviated by the dynamic load balancing from Charm++ system. Due to this, high performance gain can be achieved. For the testcases studied in the current work, the parallel performance gain ranged from 1.5× to 3.7×. Therefore, the developed p ‐adaptive DG method can significantly reduce the total simulation time in comparison to the standard DG method without p ‐adaptation.

97 MATHEMATICS AND COMPUTING↗

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↗

Discontinuous Galerkin sparse grids methods for time domain Maxwell’s equations

In this paper, we present a time-explicit sparse grid discontinuous Galerkin method for solving the three-dimensional time-domain Maxwell equations. The conservation properties and convergence rates are established for different choices of numerical fluxes. The convergence rates are proved theoretically and then verified by several numerical examples. Even though our scheme does not preserve the divergence, but by implying the higher order polynomial, one can observe the same convergence rate as numerical solution. Several numerical tests are presented to validate these conclusions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Realizability-preserving discontinuous Galerkin method for spectral two-moment radiation transport in special relativity

Here we present a realizability-preserving numerical method for solving a spectral two-moment model to simulate the transport of massless, neutral particles interacting with a steady background material moving with relativistic velocities. The model is obtained as the special relativistic limit of a four-momentum-conservative general relativistic two-moment model. Using a maximum-entropy closure, we solve for the Eulerian-frame energy and momentum. The proposed numerical method is designed to preserve moment realizability, which corresponds to moments defined by a nonnegative phase-space density. The realizability-preserving method is achieved with the following key components: (i) a discontinuous Galerkin phase-space discretization with specially constructed numerical fluxes in the spatial and energy dimensions; (ii) a strong stability-preserving implicit-explicit time-integration method; (iii) a realizability-preserving conserved to primitive moment solver; (iv) a realizability-preserving implicit collision solver; and (v) a realizability-enforcing limiter. Component (iii) is necessitated by the closure procedure, which closes higher order moments nonlinearly in terms of primitive moments. The nonlinear conserved to primitive and the implicit collision solves are formulated as fixed-point problems, which are solved with custom iterative solvers designed to preserve the realizability of each iterate. With a series of numerical tests, we demonstrate the accuracy and robustness of this discontinuous-Galerkin-implicit-explicit method.

79 ASTRONOMY AND ASTROPHYSICS↗

Subcell limiting strategies for discontinuous Galerkin spectral element methods

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

97 MATHEMATICS AND COMPUTING↗

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↗

A Mixed Discontinuous Galerkin Method for Linear Elasticity with Strongly Imposed Symmetry

In this paper, we study a mixed discontinuous Galerkin (MDG) method to solve linear elasticity problem with arbitrary order discontinuous finite element spaces in d -dimension ( \(d=2,3\) ). This method uses polynomials of degree \(k+1\) for the stress and of degree k for the displacement ( \(k\ge 0\) ). The mixed DG scheme is proved to be well-posed under proper norms. Specifically, we prove that, for any \(k \ge 0\) , the \(H(\mathrm{div})\) -like error estimate for the stress and \(L^2\) error estimate for the displacement are optimal. We further establish the optimal \(L^2\) error estimate for the stress provided that the \({\mathcal {P}}_{k+2}-{\mathcal {P}}_{k+1}^{-1}\) Stokes pair is stable and \(k \ge d\) . Finally, we also provide numerical results of MDG showing that the orders of convergence are actually sharp.

97 MATHEMATICS AND COMPUTING↗

Conservative discontinuous Galerkin interpolation: Sheared boundary conditions

Local studies of accretion disks and laboratory magnetized plasmas employ analytical coordinate mappings that introduce sheared boundary conditions (BCs). Here, we present a discontinuous Galerkin (DG) algorithm to apply such BCs based on projections and quadrature-free integration. The procedure is high-order accurate, preserves moments exactly and works in multiple dimensions. Tests of increasing complexity are provided, beginning with translations of one and two dimensional fields, followed by 3D and 5D simulations with sheared (twist-shift) BCs. Results show that the algorithm is (p + 1)-order accurate in the DG representation and (p + 2) -order accurate in the cell averages, with p being the order of the polynomial basis. Quantification of the algorithm's hyperdiffusion and discussion of aliasing errors are given. This technique enables conservative local simulations of plasma turbulence with DG, not possible until now.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Conservative discontinuous Galerkin schemes for nonlinear Dougherty–Fokker–Planck collision operators

Here, we present a novel discontinuous Galerkin algorithm for the solution of a class of Fokker–Planck collision operators. These operators arise in many fields of physics, and our particular application is for kinetic plasma simulations. In particular, we focus on an operator often known as the ‘Lenard–Bernstein’ or ‘Dougherty’ operator. Several novel algorithmic innovations, based on the concept of weak equality, are reported. These weak equalities are used to define weak operators that compute primitive moments, and are also used to determine a reconstruction procedure that allows an efficient and accurate discretization of the diffusion term. We show that when two integrations by parts are used to construct the discrete weak form, and finite velocity-space extents are accounted for, a scheme that conserves density, momentum and energy exactly is obtained. One novel feature is that the requirements of momentum and energy conservation lead to unique formulas to compute primitive moments. Careful definition of discretized moments also ensure that energy is conserved in the piecewise linear case, even though the kinetic-energy term, $v^2$ is not included in the basis set used in the discretization. A series of benchmark problems is presented and shows that the scheme conserves momentum and energy to machine precision. Empirical evidence also indicates that entropy is a non-decreasing function. The collision terms are combined with the Vlasov equation to study collisional Landau damping and plasma heating via magnetic pumping.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Precise 3D reactor core calculation using spherical harmonics and discontinuous Galerkin finite element methods

We study the use of P{sub N} method in angle and discontinuous Galerkin is space to solve 3D neutron transport problem. P{sub N} method consists in developing the angular flux on truncated spherical harmonics basic. In this paper, we couple this method with the discontinuous finite elements in space to obtain a complete discretization of the multigroup neutron transport equation. To investigate its precision, the method was applied to Takeda and C5G7 benchmark problems. These calculations point out that the proposed P{sub N}-DG method is capable of producing accurate solutions in small computational time, and that it is able to handle complex 3D geometries. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

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↗

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↗