Search NASA⌕ Search

SEARCH · Search NASA

Results for “Reconstructed 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 19 records

De-Aliasing Through Over-Integration Applied to the Flux Reconstruction and Discontinuous Galerkin Methods

High-order methods are quickly becoming popular for turbulent flows as the amount of computer processing power increases. The flux reconstruction (FR) method presents a unifying framework for a wide class of high-order methods including discontinuous Galerkin (DG), Spectral Difference (SD), and Spectral Volume (SV). It offers a simple, efficient, and easy way to implement nodal-based methods that are derived via the differential form of the governing equations. Whereas high-order methods have enjoyed recent success, they have been known to introduce numerical instabilities due to polynomial aliasing when applied to under-resolved nonlinear problems. Aliasing errors have been extensively studied in reference to DG methods; however, their study regarding FR methods has mostly been limited to the selection of the nodal points used within each cell. Here, we extend some of the de-aliasing techniques used for DG methods, primarily over-integration, to the FR framework. Our results show that over-integration does remove aliasing errors but may not remove all instabilities caused by insufficient resolution (for FR as well as DG).

High-Order↗

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

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

High-Order Methods↗

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

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

High-Order Methods↗

A Reconstruction Approach to High-Order Schemes Including Discontinuous Galerkin for Diffusion

We introduce a new approach to high-order accuracy for the numerical solution of diffusion problems by solving the equations in differential form using a reconstruction technique. The approach has the advantages of simplicity and economy. It results in several new high-order methods including a simplified version of discontinuous Galerkin (DG). It also leads to new definitions of common value and common gradient quantities at each interface shared by the two adjacent cells. In addition, the new approach clarifies the relations among the various choices of new and existing common quantities. Fourier stability and accuracy analyses are carried out for the resulting schemes. Extensions to the case of quadrilateral meshes are obtained via tensor products. For the two-point boundary value problem (steady state), it is shown that these schemes, which include most popular DG methods, yield exact common interface quantities as well as exact cell average solutions for nearly all cases.

Huynh, H. T.↗

High-Order Space-Time Methods for Conservation Laws

Current high-order methods such as discontinuous Galerkin and/or flux reconstruction can provide effective discretization for the spatial derivatives. Together with a time discretization, such methods result in either too small a time step size in the case of an explicit scheme or a very large system in the case of an implicit one. To tackle these problems, two new high-order space-time schemes for conservation laws are introduced: the first is explicit and the second, implicit. The explicit method here, also called the moment scheme, achieves a Courant-Friedrichs-Lewy (CFL) condition of 1 for the case of one-spatial dimension regardless of the degree of the polynomial approximation. (For standard explicit methods, if the spatial approximation is of degree p, then the time step sizes are typically proportional to 1/p(exp 2)). Fourier analyses for the one and two-dimensional cases are carried out. The property of super accuracy (or super convergence) is discussed. The implicit method is a simplified but optimal version of the discontinuous Galerkin scheme applied to time. It reduces to a collocation implicit Runge-Kutta (RK) method for ordinary differential equations (ODE) called Radau IIA. The explicit and implicit schemes are closely related since they employ the same intermediate time levels, and the former can serve as a key building block in an iterative procedure for the latter. A limiting technique for the piecewise linear scheme is also discussed. The technique can suppress oscillations near a discontinuity while preserving accuracy near extrema. Preliminary numerical results are shown

Huynh, H. T.↗

Entropy Stable Wall Boundary Conditions for the Compressible Navier-Stokes Equations

Non-linear entropy stability and a summation-by-parts framework are used to derive entropy stable wall boundary conditions for the compressible Navier-Stokes equations. A semi-discrete entropy estimate for the entire domain is achieved when the new boundary conditions are coupled with an entropy stable discrete interior operator. The data at the boundary are weakly imposed using a penalty flux approach and a simultaneous-approximation-term penalty technique. Although discontinuous spectral collocation operators are used herein for the purpose of demonstrating their robustness and efficacy, the new boundary conditions are compatible with any diagonal norm summation-by-parts spatial operator, including finite element, finite volume, finite difference, discontinuous Galerkin, and flux reconstruction schemes. The proposed boundary treatment is tested for three-dimensional subsonic and supersonic flows. The numerical computations corroborate the non-linear stability (entropy stability) and accuracy of the boundary conditions.

Parsani, Matteo↗

Shock Capturing via Limiting for High-Order Methods Including Discontinuous Galerkin

As is well-known, popular high-order methods such as discontinuous Galerkin (DG) and flux reconstruction (FR) tend to generate oscillations near shocks and discontinuities, which can lead to negative pressure or density, ultimately causing code breakdown. For standard second-order methods, one approach to mitigating oscillations is to impose constraints on the calculated slopes, ensuring they do not become excessively steep. This limiting process is rooted in the idea of preserving monotonicity introduced by Van Leer (1974): when the data are monotone, limiting the slopes result in a monotone piecewise linear solution. However, a drawback of this approach is the loss of accuracy near extrema, where the non-monotone solution is somewhat flattened and achieves only first-order accuracy.

numerical methods↗

Shock Capturing via Limiting for High-Order Methods including Discontinuous Galerkin

High-order methods, such as discontinuous Galerkin (DG), spectral, and flux reconstruction (FR), are prone to generating unwanted oscillations near shocks and discontinuities. Conventional limiting techniques, while effective in suppressing oscillations near shocks, often compromise accuracy near extrema, where the solution is only first-order accurate. This paper introduces a novel limiting technique for these high-order schemes, aimed at effectively managing shocks while preserving accuracy. The key idea is to expand the standard monotonicity limits to provide “room” near smooth extrema, ensuring that limiting has no effect and thus preserving accuracy. Near a discontinuity, these expanded limits effectively reduce to the original monotonicity limits, suppressing oscillations. Additional motivation is drawn from a formula for the derivative of Radau polynomials, which depicts the behavior of oscillations resulting from discontinuities. This behavior leads to a simplification by applying the limits to the sum of magnitudes of all modes, linear and higher degree. Unlike typical approaches, which rely on successful detection to activate limiting, our limiter depends continuously on the data, there by avoiding potential issues if detection fails. To reduce computing time, efficient criteria for detecting smooth regions where limiting is unnecessary are presented. Combined with detection, the continuous dependence on the data is lost, but the method is more economical. A notable characteristic of the entire process is its simplicity in both concept and implementation. Numerical tests for advection and Euler equations are conducted to demonstrate the effectiveness of the proposed method.

numerical methods↗

Shock Capturing via Limiting for High-Order Methods including Discontinuous Galerkin

High-order methods, such as discontinuous Galerkin (DG), spectral, and flux reconstruction (FR), are prone to generating unwanted oscillations near shocks and discontinuities. Conventional limiting techniques, while effective in suppressing oscillations near shocks, often compromise accuracy near extrema, where the solution is only first-order accurate. This paper introduces a novel limiting technique for these high-order schemes, aimed at effectively managing shocks while preserving accuracy. The key idea is to expand the standard monotonicity limits to provide “room” near smooth extrema, ensuring that limiting has no effect and thus preserving accuracy. Near a discontinuity, these expanded limits effectively reduce to the original monotonicity limits, suppressing oscillations. Additional motivation is drawn from a formula for the derivative of Radau polynomials, which depicts the behavior of oscillations resulting from discontinuities. This behavior leads to a simplification by applying the limits to the sum of magnitudes of all modes, linear and higher degree. Unlike typical approaches, which rely on successful detection to activate limiting, our limiter depends continuously on the data, there by avoiding potential issues if detection fails. To reduce computing time, efficient criteria for detecting smooth regions where limiting is unnecessary are presented. Combined with detection, the continuous dependence on the data is lost, but the method is more economical. A notable characteristic of the entire process is its simplicity in both concept and implementation. Numerical tests for advection and Euler equations are conducted to demonstrate the effectiveness of the proposed method.

numerical methods↗

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

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

Direct Numerical Simulations↗

Entropy Stable Staggered Grid Spectral Collocation for the Burgers' and Compressible Navier-Stokes Equations

Staggered grid, entropy stable discontinuous spectral collocation operators of any order are developed for Burgers' and the compressible Navier-Stokes equations on unstructured hexahedral elements. This generalization of previous entropy stable spectral collocation work [1, 2], extends the applicable set of points from tensor product, Legendre-Gauss-Lobatto (LGL) to a combination of tensor product Legendre-Gauss (LG) and LGL points. The new semi-discrete operators discretely conserve mass, momentum, energy and satisfy a mathematical entropy inequality for both Burgers' and the compressible Navier-Stokes equations in three spatial dimensions. They are valid for smooth as well as discontinuous flows. The staggered LG and conventional LGL point formulations are compared on several challenging test problems. The staggered LG operators are significantly more accurate, although more costly to implement. The LG and LGL operators exhibit similar robustness, as is demonstrated using test problems known to be problematic for operators that lack a nonlinearly stability proof for the compressible Navier-Stokes equations (e.g., discontinuous Galerkin, spectral difference, or flux reconstruction operators).

Carpenter, Mark H.↗

Entropy Stable Wall Boundary Conditions for the Three-Dimensional Compressible Navier-Stokes Equations

Non-linear entropy stability and a summation-by-parts framework are used to derive entropy stable wall boundary conditions for the three-dimensional compressible Navier-Stokes equations. A semi-discrete entropy estimate for the entire domain is achieved when the new boundary conditions are coupled with an entropy stable discrete interior operator. The data at the boundary are weakly imposed using a penalty flux approach and a simultaneous-approximation-term penalty technique. Although discontinuous spectral collocation operators on unstructured grids are used herein for the purpose of demonstrating their robustness and efficacy, the new boundary conditions are compatible with any diagonal norm summation-by-parts spatial operator, including finite element, finite difference, finite volume, discontinuous Galerkin, and flux reconstruction/correction procedure via reconstruction schemes. The proposed boundary treatment is tested for three-dimensional subsonic and supersonic flows. The numerical computations corroborate the non-linear stability (entropy stability) and accuracy of the boundary conditions.

Parsani, Matteo↗

A Posteriori Error Estimation for Finite Volume and Finite Element Approximations Using Broken Space Approximation

We consider a posteriori error estimates for finite volume and finite element methods on arbitrary meshes subject to prescribed error functionals. Error estimates of this type are useful in a number of computational settings: (1) quantitative prediction of the numerical solution error, (2) adaptive meshing, and (3) load balancing of work on parallel computing architectures. Our analysis recasts the class of Godunov finite volumes schemes as a particular form of discontinuous Galerkin method utilizing broken space approximation obtained via reconstruction of cell-averaged data. In this general framework, weighted residual error bounds are readily obtained using duality arguments and Galerkin orthogonality. Additional consideration is given to issues such as nonlinearity, efficiency, and the relationship to other existing methods. Numerical examples are given throughout the talk to demonstrate the sharpness of the estimates and efficiency of the techniques. Additional information is contained in the original.

Barth, Timothy J.↗

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

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

Huynh, H. T.↗

Discontinuous Spectral Difference Method for Conservation Laws on Unstructured Grids

A new, high-order, conservative, and efficient discontinuous spectral finite difference (SD) method for conservation laws on unstructured grids is developed. The concept of discontinuous and high-order local representations to achieve conservation and high accuracy is utilized in a manner similar to the Discontinuous Galerkin (DG) and the Spectral Volume (SV) methods, but while these methods are based on the integrated forms of the equations, the new method is based on the differential form to attain a simpler formulation and higher efficiency. Conventional unstructured finite-difference and finite-volume methods require data reconstruction based on the least-squares formulation using neighboring point or cell data. Since each unknown employs a different stencil, one must repeat the least-squares inversion for every point or 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 addition, the finite-difference method does not satisfy the integral conservation in general. By contrast, the DG and SV methods employ a local, universal reconstruction of a given order of accuracy in each cell in terms of internally defined conservative unknowns. Since the solution is discontinuous across cell boundaries, a Riemann solver is necessary to evaluate boundary flux terms and maintain conservation. In the DG method, a Galerkin finite-element method is employed to update the nodal unknowns within each cell. This requires the inversion of a mass matrix, and the use of quadratures of twice the order of accuracy of the reconstruction to evaluate the surface integrals and additional volume integrals for nonlinear flux functions. In the SV method, the integral conservation law is used to update volume averages over subcells defined by a geometrically similar partition of each grid cell. As the order of accuracy increases, the partitioning for 3D requires the introduction of a large number of parameters, whose optimization to achieve convergence becomes increasingly more difficult. Also, the number of interior facets required to subdivide non-planar faces, and the additional increase in the number of quadrature points for each facet, increases the computational cost greatly.

Liu, Yen↗

A Survey of the Isentropic Euler Vortex Problem Using High-Order Methods

The flux reconstruction (FR) method offers a simple, efficient, and easy to implement method, and it has been shown to equate to a differential approach to discontinuous Galerkin (DG) methods. The FR method is also accurate to an arbitrary order and the isentropic Euler vortex problem is used here to empirically verify this claim. This problem is widely used in computational fluid dynamics (CFD) to verify the accuracy of a given numerical method due to its simplicity and known exact solution at any given time. While verifying our FR solver, multiple obstacles emerged that prevented us from achieving the expected order of accuracy over short and long amounts of simulation time. It was found that these complications stemmed from a few overlooked details in the original problem definition combined with the FR and DG methods achieving high-accuracy with minimal dissipation. This paper is intended to consolidate the many versions of the vortex problem found in literature and to highlight some of the consequences if these overlooked details remain neglected.

High-Order↗