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 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Solution Irregularity Remediation for Spatial Discretization Error Estimation for S N Transport Solutions

The discrete ordinates linear Boltzmann transport equation is typically solved in its spatially discretized form, incurring spatial discretization error. Quantification of this error for purposes such as adaptive mesh refinement or error analysis requires an a posteriori estimator, which utilizes the numerical solution to the spatially discretized equation to compute an estimate. Because the quality of the numerical solution informs the error estimate, irregularities, present in the true solution for any realistic problem configuration, tend to cause the largest deviation in the error estimate vis-a-vis the true error. In this paper, an analytical partial singular characteristic tracking (pSCT) procedure for reducing the estimator’s error is implemented within our novel residual source estimator for a zeroth-order discontinuous Galerkin scheme, at the additional cost of a single inner iteration. Here, a metric-based evaluation of the pSCT scheme versus the standard residual source estimator is performed over the parameter range of a Method of Manufactured Solutions test suite. The pSCT scheme generates near-ideal accuracy in the estimate in problems where the dominant source of the estimator’s error is the solution irregularity, namely, problems where the true solution is discontinuous and problems where the true solution’s first derivative is discontinuous and the scattering ratio is low. In problems where the scattering ratio is high and the true solution is discontinuous in the first derivative, the error in the scattering source, which is not converged by the pSCT scheme, is greater than the error incurred due to the irregularity. Ultimately, a pSCT scheme is judged to be useful for error estimation in problems where the computational cost of the scheme is justified. In the presence of many irregularities, such a scheme may be intractable for general use, but in benchmarks, as an analytical tool, or in problems that have nondissipative discontinuities, the scheme may prove invaluable.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS2017

On High-Order Upwind Methods for Advection

In the fourth installment of the celebrated series of five papers entitled "Towards the ultimate conservative difference scheme", Van Leer (1977) introduced five schemes for advection, the first three are piecewise linear, and the last two, piecewise parabolic. Among the five, scheme I, which is the least accurate, extends with relative ease to systems of equations in multiple dimensions. As a result, it became the most popular and is widely known as the MUSCL scheme (monotone upstream-centered schemes for conservation laws). Schemes III and V have the same accuracy, are the most accurate, and are closely related to current high-order methods. Scheme III uses a piecewise linear approximation that is discontinuous across cells, and can be considered as a precursor of the discontinuous Galerkin methods. Scheme V employs a piecewise quadratic approximation that is, as opposed to the case of scheme III, continuous across cells. This method is the basis for the on-going "active flux scheme" developed by Roe and collaborators. Here, schemes III and V are shown to be equivalent in the sense that they yield identical (reconstructed) solutions, provided the initial condition for scheme III is defined from that of scheme V in a manner dependent on the CFL number. This equivalence is counter intuitive since it is generally believed that piecewise linear and piecewise parabolic methods cannot produce the same solutions due to their different degrees of approximation. The finding also shows a key connection between the approaches of discontinuous and continuous polynomial approximations. In addition to the discussed equivalence, a framework using both projection and interpolation that extends schemes III and V into a single family of high-order schemes is introduced. For these high-order extensions, it is demonstrated via Fourier analysis that schemes with the same number of degrees of freedom 𝐾 per cell, in spite of the different piecewise polynomial degrees, share the same sets of eigenvalues and thus, have the same stability and accuracy. Moreover, these schemes are accurate to order 2𝐾−1, which is higher than the expected order of 𝐾.

high-order methods↗
NASA NTRS2004

Three-Dimensional High-Order Spectral Volume Method for Solving Maxwell's Equations on Unstructured Grids

A three-dimensional, high-order, conservative, and efficient discontinuous spectral volume (SV) method for the solutions of Maxwell's equations on unstructured grids is presented. The concept of discontinuous 2nd high-order loca1 representations to achieve conservation and high accuracy is utilized in a manner similar to the Discontinuous Galerkin (DG) method, but instead of using a Galerkin finite-element formulation, the SV method is based on a finite-volume approach to attain a simpler formulation. Conventional unstructured finite-volume methods require data reconstruction based on the least-squares formulation using neighboring cell data. Since each unknown employs a different stencil, one must repeat the least-squares inversion for every cell at each time step, or to store the inversion coefficients. In a high-order, three-dimensional computation, the former would involve impractically large CPU time, while for the latter the memory requirement becomes prohibitive. In the SV method, one starts with a relatively coarse grid of triangles or tetrahedra, called spectral volumes (SVs), and partition each SV into a number of structured subcells, called control volumes (CVs), that support a polynomial expansion of a desired degree of precision. The unknowns are cell averages over CVs. If all the SVs are partitioned in a geometrically similar manner, the reconstruction becomes universal as a weighted sum of unknowns, and only a few universal coefficients need to be stored for the surface integrals over CV faces. Since the solution is discontinuous across the SV boundaries, a Riemann solver is thus necessary to maintain conservation. In the paper, multi-parameter and symmetric SV partitions, up to quartic for triangle and cubic for tetrahedron, are first presented. The corresponding weight coefficients for CV face integrals in terms of CV cell averages for each partition are analytically determined. These discretization formulas are then applied to the integral form of the Maxwell equations. All numerical procedures for outer boundary, material interface, zonal interface, and interior SV face are unified with a single characteristic formulation. The load balancing in a massive parallel computing environment is therefore easier to achieve. A parameter is introduced in the Riemann solver to control the strength of the smoothing term. Important aspects of the data structure and its effects to communication and the optimum use of cache memory are discussed. Results will be presented for plane TE and TM waves incident on a perfectly conducting cylinder for up to fifth order of accuracy, and a plane wave incident on a perfectly conducting sphere for up to fourth order of accuracy. Comparisons are made with exact solutions for these cases.

Liu, Yen↗
DOE OSTI2020

Blood flow imaging by optimal matching of computational fluid dynamics to 4D-flow data

Three-dimensional, time-resolved blood flow measurement (4D-flow) is a powerful research and clinical tool, but improved resolution and scan times are needed. Therefore, this study aims to (1) present a postprocessing framework for optimization-driven simulation-based flow imaging, called 4D-flow High-resolution Imaging with a priori Knowledge Incorporating the Navier-Stokes equations and the discontinuous Galerkin method (4D-flow HIKING), (2) investigate the framework in synthetic tests, (3) perform phantom validation using laser particle imaging velocimetry, and (4) demonstrate the use of the framework in vivo. An optimizing computational fluid dynamics solver including adjoint-based optimization was developed to fit computational fluid dynamics solutions to 4D-flow data. Synthetic tests were performed in 2D, and phantom validation was performed with pulsatile flow. Reference velocity data were acquired using particle imaging velocimetry, and 4D-flow data were acquired at 1.5 T. In vivo testing was performed on intracranial arteries in a healthy volunteer at 7 T, with 2D flow as the reference. Results Synthetic tests showed low error (0.4%-0.7%). Phantom validation showed improved agreement with laser particle imaging velocimetry compared with input 4D-flow in the horizontal (mean -0.05 vs -1.11 cm/s, P < .001; SD 1.86 vs 4.26 cm/s, P < .001) and vertical directions (mean 0.05 vs -0.04 cm/s, P = .29; SD 1.36 vs 3.95 cm/s, P < .001). In vivo data show a reduction in flow rate error from 14% to 3.5%. Phantom and in vivo results from 4D-flow HIKING show promise for future applications with higher resolution, shorter scan times, and accurate quantification of physiological parameters.

4D-flow MRI↗
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 OSTI2026

A sweeping positivity-preserving high-order finite difference WENO scheme for Euler equations

We develop a simple, high-order, conservative and robust positivity-preserving sweeping procedure for the density and the nonlinear pressure function in the compressible Euler equations. Using the scaling limiter in Zhang and Shu (J Comput Phys 229:3091–3120, 2010), we obtain a non-trivial extension of the scalar sweeping technique in Liu et al. (J Sci Comput 73:1028–1071, 2017) for the positivity of pressure. The sweeping procedure developed in this paper is a post-processing technique, which can be applied to any concave functions of the conserved variables in hyperbolic conservation law systems. Thus, it has applications beyond the Euler equations. This procedure preserves positivity and conservation of physical quantities without destroying the accuracy of the underlying scheme. The algorithm works for general schemes including finite difference, finite volume and discontinuous Galerkin methods; however, in this paper we focus on finite difference weighted essentially non-oscillatory (WENO) methods. As a result, we provide numerical tests of the fifth-order finite difference WENO scheme to demonstrate the accuracy and robustness of the technique.

Compressible Euler equations↗
DOE OSTI2021

An experimental comparison of a space-time multigrid method with PFASST for a reaction-diffusion problem

We consider two parallel-in-time approaches applied to a (reaction) diffusion problem, possibly non-linear. In particular, we consider PFASST (Parallel Full Approximation Scheme in Space and Time) and space-time multigrid strategies. For both approaches, we start from an integral formulation of the continuous time dependent problem. Then, a collocation form for PFASST and a discontinuous Galerkin discretization in time for the space-time multi-grid are employed, resulting in the same discrete solution at the time nodes. Strong and weak scaling of both multilevel strategies are compared for varying orders of the temporal discretization. Moreover, we investigate the respective convergence behavior for non-linear problems and highlight quantitative differences in execution times

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Train small, model big: Scalable physics simulators via reduced order modeling and domain decomposition

Numerous cutting-edge scientific technologies originate at the laboratory scale, but transitioning them to practical industry applications is a formidable challenge. Traditional pilot projects at intermediate scales are costly and time-consuming. An alternative, the pilot-scale model, relies on high-fidelity numerical simulations, but even these simulations can be computationally prohibitive at larger scales. To overcome these limitations, we propose a scalable, physics-constrained reduced order model (ROM) method. The ROM identifies critical physics modes from small-scale unit components, projecting governing equations onto these modes to create a reduced model that retains essential physics details. We also employ Discontinuous Galerkin Domain Decomposition (DG-DD) to apply ROM to unit components and interfaces, enabling the construction of large-scale global systems without data at such large scales. Here this method is demonstrated on the Poisson and Stokes flow equations, showing that it can solve equations about 15–40 times faster with only ~1% relative error. Furthermore, ROM takes one order of magnitude less memory than the full order model, enabling larger scale predictions at a given memory limitation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Matrix-free subcell residual distribution for Bernstein finite elements: Monolithic limiting

This paper is focused on the aspects of limiting in residual distribution (RD) schemes for high-order finite element approximations to advection problems. Both continuous and discontinuous Galerkin methods are considered in this work. Discrete maximum principles are enforced using algebraic manipulations of element contributions to the global nonlinear system. The required modifications can be carried out without calculating the element matrices and assembling their global counterparts. The components of element vectors associated with the standard Galerkin discretization are manipulated directly using localized subcell weights to achieve optimal accuracy. Low-order nonlinear RD schemes of this kind were originally developed to calculate local extremum diminishing predictors for flux-corrected transport (FCT) algorithms. In the present paper, we incorporate limiters directly into the residual distribution procedure, which makes it applicable to stationary problems and leads to well-posed nonlinear discrete problems. To circumvent the second-order accuracy barrier, the correction factors of monolithic limiting approaches and FCT schemes are adjusted using smoothness sensors based on second derivatives. Finally, the convergence behavior of presented methods is illustrated by numerical studies for two-dimensional test problems.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Residual estimation for grid modification in wall-modeled large eddy simulation using unstructured high-order methods

Here, the accuracy and computational cost of a large eddy simulation are highly dependent on the computational grid. Building optimal grids manually from a priori knowledge is not feasible in most practical use cases; instead, solution-adaptive strategies can provide a robust and cost-efficient method to generate a grid with the desired accuracy. We adapt the residual estimation algorithm developed by Toosi and Larsson for Discontinuous Galerkin Spectral Elements Methods (DGSEM) to guide the grid-adaptation process. The core of the method is the computation of the estimated modeling residual using the polynomial basis functions used in DGSEM, and the averaging of the estimated residual over each element. The final method is assessed in multiple channel flow test cases and for the transonic flow over an airfoil, in both cases making use of mortar interfaces between elements with hanging nodes. The method is found to be robust and reliable, and to provide solutions on grids with significantly fewer elements at comparable accuracy compared to when using human-generated grids.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

OpenSn: A massively parallel, open-source simulation environment for discrete ordinates radiation transport

OpenSn is an open-source, massively parallel deterministic radiation transport code for solving the discrete-ordinates ( S N ) form of the Boltzmann transport equation on unstructured, arbitrary polyhedral meshes. It supports high-fidelity simulations involving steady-state, eigenvalue, and adjoint problems for neutral particles (e.g., neutrons, photons, multi-particles), using the multigroup approximation in energy. OpenSn combines angular discretization via discrete ordinates with a discontinuous Galerkin finite element method (DGFEM) in space, enabling accurate resolution of transport physics on arbitrary polyhedral cells, included locally refined spatial grids. It includes multiple angular quadrature types, including locally refined angular quadratures. Written in modern C++ with a Python API, OpenSn runs efficiently on platforms ranging from laptops to supercomputers. The transport sweep algorithm is implemented using a task-based, directed-acyclic-graph (DAG) approach for each angle and supports asynchronous parallelism across thousands of MPI ranks. Group-set aggregation improves compute intensity, and synthetic acceleration techniques (e.g., diffusion synthetic acceleration, second-moment method) enhance solver convergence. OpenSn has been verified on reactor physics problems and demonstrated excellent weak and strong scaling performance on more than 32,768 processes, making it a versatile and robust platform for large-scale transport simulations in complex geometries.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2021

Quantum Fokker-Planck modeling of degenerate electrons

In this work, an implicit and conservative numerical scheme is proposed for the isotropic quantum Fokker-Planck equation describing the evolution of degenerate electrons subject to elastic collisions with other electrons and ions. The electron-ion and electron-electron collision operators are discretized using a discontinuous Galerkin method, and the electron energy distribution is updated by an implicit time integration method. The numerical scheme is designed to satisfy all conservation laws exactly. Numerical tests and comparisons with other modeling approaches are shown to demonstrate the accuracy and conservation properties of the proposed method.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Dyn$\mathrm{AMO}$: Multi-agent reinforcement learning for dynamic anticipatory mesh optimization with applications to hyperbolic conservation laws

Here we introduce DynAMO, a reinforcement learning paradigm for Dynamic Anticipatory Mesh Optimization. Adaptive mesh refinement is an effective tool for optimizing computational cost and solution accuracy in numerical methods for partial differential equations. However, traditional adaptive mesh refinement approaches for time-dependent problems typically rely only on instantaneous error indicators to guide adaptivity. As a result, standard strategies often require frequent remeshing to maintain accuracy. In the DynAMO approach, multi-agent reinforcement learning is used to discover new local refinement policies that can anticipate and respond to future solution states by producing meshes that deliver more accurate solutions for longer time intervals. By applying DynAMO to discontinuous Galerkin methods for the linear advection and compressible Euler equations in two dimensions, we demonstrate that this new mesh refinement paradigm can outperform conventional threshold-based strategies while also generalizing to different mesh sizes, remeshing and simulation times, and initial conditions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Recent advances in computational mathematics and applications

We are honored to bring you this special issue dedicated to recent advances in computational mathematics and applications in science and engineering. The papers in this special issue were presented in ”Conference on Computational Mathematics and Applications (CCMA)” held at the University of Nevada Las Vegas (UNLV) during October 25–27, 2019. The conference has attracted about 90 attendees from six countries. The 15 papers in the special issue comprise a diverse collection of theoretical numerical analysis as well as applications in various subjects. Topics cover optimal control of PDEs, discontinuous Galerkin methods, fluid flow in porous media, turbulence flow, static and moving interface problems, complex fluids composed by the mixture of Newtonian fluid and nematic (liquid crystal) flows, modeling of ocean–atmosphere system, image segmentation algorithm, uncertainty quantification problems for turbulence model and Maxwell’s equations, iterative solver for systems resulting from mixed methods, and novel methods for solving systems of nonlinear equations. As the Guest Editors we would like to thank Dr. Leland Jameson at NSF (National Science Foundation) for kindly supporting our conference proposal which made this conference possible. We would also like to thank Darren Sugrue from Elsevier who provided partial support for our conference, and Thennarasu Gunasekaran and his production team from Elsevier who produced this nice special issue. We are grateful to many people (Dr. Zhijian Wu, Lori Ornelas, Elsa Juarez, and many Ph.D. students) at the Department of Mathematical Sciences of UNLV who provided tremendous support for the conference. Finally, we very much appreciate all authors who contributed their precious results to this special issue.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A Verification Suite of Test Cases for the Barotropic Solver of Ocean Models

Abstract The development of any atmosphere or ocean model warrants a suite of test cases (TCs) to verify its spatial and temporal discretizations, order of accuracy, stability, reproducibility, portability, scalability, etc. In this paper, we present a suite of shallow water TCs designed to verify the barotropic solver of atmosphere and ocean models. These include the non‐dispersive coastal Kelvin wave; the dispersive inertia‐gravity wave; the dispersive planetary and topographic Rossby waves; the barotropic tide; and a non‐linear manufactured solution. These TCs check the implementation of the linear pressure gradient term; the linear constant or variable‐coefficient Coriolis and bathymetry terms; and the non‐linear advection terms. Simulation results are presented for a variety of time‐stepping methods as well as two spatial discretizations: a mimetic finite volume method based on the TRiSK scheme, and a high‐order discontinuous Galerkin spectral element method. The experimental procedure for conducting these numerical experiments is detailed. It underscores several key considerations that vary depending on the chosen spatial discretization method. Finally, convergence studies of every TC are conducted with refinement in both space and time, only in space, and only in time. The convergence slopes match the expected theoretical predictions.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

A higher-order finite element reactive transport model for unstructured and fractured grids

Abstract This work presents a new reactive transport framework that combines a powerful geochemistry engine with advanced numerical methods for flow and transport in subsurface fractured porous media. Specifically, the PhreeqcRM interface (developed by the USGS) is used to take advantage of a large library of equilibrium and kinetic aqueous and fluid-rock reactions, which has been validated by numerous experiments and benchmark studies. Fluid flow is modeled by the Mixed Hybrid Finite Element (FE) method, which provides smooth velocity fields even in highly heterogenous formations with discrete fractures. A multilinear Discontinuous Galerkin FE method is used to solve the multicomponent transport problem. This method is locally mass conserving and its second order convergence significantly reduces numerical dispersion. In terms of thermodynamics, the aqueous phase is considered as a compressible fluid and its properties are derived from a Cubic Plus Association (CPA) equation of state. The new simulator is validated against several benchmark problems (involving, e.g., Fickian and Nernst-Planck diffusion, isotope fractionation, advection-dispersion transport, and rock-fluid reactions) before demonstrating the expanded capabilities offered by the underlying FE foundation, such as high computational efficiency, parallelizability, low numerical dispersion, unstructured 3D gridding, and discrete fraction modeling.

58 GEOSCIENCES↗
DOE OSTI2026

An implicit-explicit time splitting strategy for the far SOL plasma fluid model with DG-FEM discretization

We consider a far scrape-off layer (SOL) plasma fluid model of ions that is governed by a Braginskiitype model: a one-dimensional, nonlinear system of advection-diffusion equations coupled with a diffusion equation for neutral particles. Our motivation for studying this system arises from the coupling between the edge plasma and radio-frequency (RF) heating, where solving a far SOL plasma fluid model provides critical insights into edge plasma dynamics. Numerical simulations of plasma fluid models require advanced computational techniques to achieve both efficiency and accuracy, especially when resolving the boundary layer in magnetically confined plasmas. In this work, we propose an implicit-explicit time operator splitting strategy that allows for an efficient solution algorithm, where the diffusive terms are treated semi-implicitly requiring only a linear solve, while the advection part is handled explicitly using a strong-stability-preserving Runge-Kutta (SSP-RK3) scheme. This leads to a fully decoupled system in which the diffusion and advection sub-problems can be solved separately, simplifying the overall solution procedure and allowing for efficient parallelization, which is particularly relevant for exploring the impact of RF heating on the SOL plasma. The main challenge of the discretization is due to the strong coupling between diffusion and advection, particularly through the boundary conditions. This makes implementation of such a scheme in an accurate and stable manner nontrivial. We discuss in detail how to split the equations and manage boundary conditions to maintain stability and well-posedness for each subsystem. We also describe a spatial discretization approach, based on the discontinuous Galerkin finite element method (DG-FEM) and present numerical results for a one-dimensional system.

Burkovska, Olena [ORNL] (ORCID:0000000163101130)↗
DOE OSTI2020

Continuum electromagnetic gyrokinetic simulations of turbulence in the tokamak scrape-off layer and laboratory devices

Here, we present algorithms and results from Gkeyll, a full-f continuum, electromagnetic gyrokinetic code, designed to study turbulence in the edge region of fusion devices. The edge is computationally very challenging, requiring robust algorithms that can handle large-amplitude fluctuations and stable interactions with plasma sheaths. We present an energy-conserving high-order discontinuous Galerkin scheme that solves gyrokinetic equations in Hamiltonian form. Efficiency is improved by a careful choice of basis functions and automatically generated computation kernels. Previous verification tests were performed in the straight-field-line large plasma device [Shi et al., J. Plasma Phys. 83, 905830304 (2017)] and the Texas Helimak, a simple magnetized torus [Bernard et al., Phys. Plasmas 26, 042301 (2019)], including the effect of end-plate biasing on turbulence. Results for the scrape-off layer for NSTX parameters with a model helical magnetic geometry with bad curvature have been obtained [Shi et al., Phys. Plasmas 26, 012307 (2019)]. In this paper, we present algorithms for the two formulations of electromagnetic gyrokinetics: the Hamiltonian and the symplectic. We describe each formulation and show results of benchmark tests. Although our scheme works for the Hamiltonian formulation, the presence of spurious numerical modes for high-β and large $k^2_⊥ρ^2_s$ regimes shows that the symplectic formulation is more robust. We then review our recent algorithm for the symplectic formulation [Mandell et al., J. Plasma Phys. 86, 905860109 (2020)], along with example application of this new capability. Maintaining positivity of the distribution function can be challenging, and we describe a new and novel exponential recovery based algorithm to address this.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗