Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Nodal discontinuous Galerkin method”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

4 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2015

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↗
NASA NTRS2004

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↗
NASA NTRS2019

Meshless Local Petrov-Galerkin (MLPG) Method with Orthogonal Polynomials for Euler-Bernoulli Beam Problems

In this paper, the feasibility of orthogonal polynomials in the meshless local Petrov Galerkin method (MLPG) method is studied. The orthogonal polynomials, Chebyshev and Legendre polynomials, are used in this MLPG method as trial functions. The test functions used were power functions with smooth derivatives at their ends. The performance of these methods is studied by applying these methods to Euler-Bernoulli beam problems. The MLPG-Galerkin and Legendre methods passed all the patch tests for simple beam problems. Next the formulations are tested on complex beam problems such as beams with partial loadings and continuous beam problems. Problems with load discontinuities and additional supports require special attention. Near discontinuities, judicious choice of number of nodes and nodal placements are needed to obtain accurate deflections, slopes, moments and shear forces. As polynomial functions are used, the large number of nodes can create a transformation matrix that is ill-conditioned, resulting in problems with the inversion of the matrix. The conditioning worsens as the number of nodes are increased beyond 20. Quadruple precision was needed for models to obtain accurate solutions. Even with quadruple precision the accuracy of the method suffers as the number of nodes is increased beyond 20. This appears to be a drawback of the MLPG-Chebyshev and MLPG-Legendre methods.

Raju, Ivatury S.↗
NASA NTRS2014

On Formulations of Discontinuous Galerkin and Related Methods for Conservation Laws

A formulation for the discontinuous Galerkin (DG) method that leads to solutions using the differential form of the equation (as opposed to the standard integral form) is presented. The formulation includes (a) a derivative calculation that involves only data within each cell with no data interaction among cells, and (b) for each cell, corrections to this derivative that deal with the jumps in fluxes at the cell boundaries and allow data across cells to interact. The derivative with no interaction is obtained by a projection, but for nodal-type methods, evaluating this derivative by interpolation at the nodal points is more economical. The corrections are derived using the approximate (Dirac) delta functions. The formulation results in a family of schemes: different approximate delta functions give rise to different methods. It is shown that the current formulation is essentially equivalent to the flux reconstruction (FR) formulation. Due to the use of approximate delta functions, an energy stability proof simpler than that of Vincent, Castonguay, and Jameson (2011) for a family of schemes is derived. Accuracy and stability of resulting schemes are discussed via Fourier analyses. Similar to FR, the current formulation provides a unifying framework for high-order methods by recovering the DG, spectral difference (SD), and spectral volume (SV) schemes. It also yields stable, accurate, and economical methods.

Huynh, H. T.↗