elib
DLR-Header
DLR-Logo -> http://www.dlr.de
DLR Portal Home | Imprint | Privacy Policy | Contact | Deutsch
Fontsize: [-] Text [+]

A Comparison of various nodal Discontinuous Galerkin Methods for the 3D Euler equations

Bergmann, Michael and Drapkina, Svetlana and Ashcroft, Graham and Frey, Christian (2016) A Comparison of various nodal Discontinuous Galerkin Methods for the 3D Euler equations. In: Proceedings of the 7th European Congress on Computational Methods in Applied Sciences and Engineering. VII European Congress on Computational Methods in Applied Sciences and Engineering, 05.-10. Juni 2016, Kreta, Griechenland.

Full text not available from this repository.

Official URL: https://www.eccomas2016.org/proceedings/pdf/6203.pdf

Abstract

Recent research has indicated that collocation-type Discontinuous Galerkin Spectral Element Methods (DGSEM) represent a more efficient alternative to the standard modal or nodal DG approaches. In this paper, we compare two collocation-type nodal DGSEM and a standard nodal DG approach in the context of the three-dimensional Euler equations. The nodal DG schemes for hexahedral elements are based on the polynomial interpolation of the unknown solution using tensor product Lagrange basis functions and the use of Gaussian quadrature for integration. In the standard nodal DG approach, we employ uniform interpolation nodes and Legendre-Gauss (LG) quadrature points. The two collocated DGSEM schemes arise from using either LG or Legendre-Gauss-Lobatto (LGL) points as both interpolation and integration nodes. The resulting diagonal mass matrices and the ability to compute the fluxes directly from the solution nodes give rise to highly efficient schemes. The results of the numerical convergence studies highlight, especially at high approximation orders, the performance improvement of the DGSEM schemes compared to the standard DG scheme. Although having advantages in the evaluation of the boundary values over the LG-DGSEM, the lower degree of precision of the LGL quadrature negates this benefit. In addition, without the application of filtering techniques or over-integration, the lower integration accuracy of the LGL-DGSEM leads to numerical instabilities at stagnation points. Hence, the LG-DGSEM is found to be the most efficient scheme as it is more accurate and robust for the considered test cases.

Item URL in elib:https://elib.dlr.de/110304/
Document Type:Conference or Workshop Item (Speech)
Title:A Comparison of various nodal Discontinuous Galerkin Methods for the 3D Euler equations
Authors:
AuthorsInstitution or Email of AuthorsAuthors ORCID iD
Bergmann, MichaelMichael.Bergmann (at) dlr.deUNSPECIFIED
Drapkina, Svetlanasvetlana.drapkina (at) dlr.deUNSPECIFIED
Ashcroft, Grahamgraham.ashcroft (at) dlr.deUNSPECIFIED
Frey, Christianchristian.frey (at) dlr.deUNSPECIFIED
Date:June 2016
Journal or Publication Title:Proceedings of the 7th European Congress on Computational Methods in Applied Sciences and Engineering
Refereed publication:Yes
Open Access:No
Gold Open Access:No
In SCOPUS:No
In ISI Web of Science:No
Status:Published
Keywords:High-order, Discontinous Galerkin Methods, Euler equations, DGSEM, nodal
Event Title:VII European Congress on Computational Methods in Applied Sciences and Engineering
Event Location:Kreta, Griechenland
Event Type:international Conference
Event Dates:05.-10. Juni 2016
Organizer:ECCOMAS
HGF - Research field:Aeronautics, Space and Transport
HGF - Program:Aeronautics
HGF - Program Themes:propulsion systems
DLR - Research area:Aeronautics
DLR - Program:L ER - Engine Research
DLR - Research theme (Project):L - Virtual Engine and Validation methods, E - Gas Turbine (old)
Location: Köln-Porz
Institutes and Institutions:Institute of Propulsion Technology > Numerical Methodes
Deposited By: Bergmann, Michael
Deposited On:09 Jan 2017 11:21
Last Modified:09 Jan 2017 11:21

Repository Staff Only: item control page

Browse
Search
Help & Contact
Information
electronic library is running on EPrints 3.3.12
Copyright © 2008-2017 German Aerospace Center (DLR). All rights reserved.