2018
DOI: 10.1016/j.jcp.2018.06.037
|View full text |Cite
|
Sign up to set email alerts
|

Robust and efficient discontinuous Galerkin methods for under-resolved turbulent incompressible flows

Abstract: We present a robust and accurate discretization approach for incompressible turbulent flows based on highorder discontinuous Galerkin methods. The DG discretization of the incompressible Navier-Stokes equations uses the local Lax-Friedrichs flux for the convective term, the symmetric interior penalty method for the viscous term, and central fluxes for the velocity-pressure coupling terms. Stability of the discretization approach for under-resolved, turbulent flow problems is realized by a purely numerical stab… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

5
129
0

Year Published

2018
2018
2019
2019

Publication Types

Select...
5

Relationship

4
1

Authors

Journals

citations
Cited by 44 publications
(134 citation statements)
references
References 66 publications
5
129
0
Order By: Relevance
“…The factor 1false/kur highlights that the time‐step size has to be reduced for increasing polynomial degrees, where the exponent r of the polynomial degree k u of the discrete velocity solution is discussed in more detail below. We will demonstrate numerically that an exponent of r =1.5 accurately models the dependency on the polynomial degree, which has, for example, been used in the work of Fehn et al, as opposed to exponents of r =1 or r =2 used in other literature works (see also the work of Hesthaven and Warburton). For high‐Reynolds‐number flow problems with high‐spatial‐resolution requirements as considered in this work, one typically observes that the CFL condition is restrictive in the sense that the temporal discretization error is negligible for Courant numbers close to the critical value.…”
Section: Efficiency Of High‐order Discretizations For the Numerical Smentioning
confidence: 97%
See 4 more Smart Citations
“…The factor 1false/kur highlights that the time‐step size has to be reduced for increasing polynomial degrees, where the exponent r of the polynomial degree k u of the discrete velocity solution is discussed in more detail below. We will demonstrate numerically that an exponent of r =1.5 accurately models the dependency on the polynomial degree, which has, for example, been used in the work of Fehn et al, as opposed to exponents of r =1 or r =2 used in other literature works (see also the work of Hesthaven and Warburton). For high‐Reynolds‐number flow problems with high‐spatial‐resolution requirements as considered in this work, one typically observes that the CFL condition is restrictive in the sense that the temporal discretization error is negligible for Courant numbers close to the critical value.…”
Section: Efficiency Of High‐order Discretizations For the Numerical Smentioning
confidence: 97%
“…In previous works, the efficiency has been evaluated from different perspectives by concentrating on one of the three influence factors. For example, the accuracy of high‐order DG discretizations has been analyzed in detail in the work of Fehn et al for laminar flow problems and in another work of Fehn et al for turbulent flow problems. In the context of DG discretizations of the compressible Navier‐Stokes equations, the accuracy of high‐order methods has been investigated, eg, in the works of Gassner and Beck and Carton de Wiart et al for the Taylor‐Green vortex problem.…”
Section: Efficiency Of High‐order Discretizations For the Numerical Smentioning
confidence: 99%
See 3 more Smart Citations