A high-order semi-explicit discontinuous Galerkin solver for 3D incompressible flow with application to DNS and LES of turbulent channel flow
Benjamin Krank, Niklas Fehn, Wolfgang A. Wall, Martin Kronbichler

TL;DR
This paper introduces a high-order semi-explicit discontinuous Galerkin solver for 3D incompressible flow, capable of large-scale DNS and LES of turbulent channel flow, with improved stability and scalability.
Contribution
The paper presents a novel semi-explicit high-order DG scheme with a divergence penalty for stable, scalable simulations of turbulent flows at high Reynolds numbers.
Findings
Successfully scaled to 34.4 billion degrees of freedom and 147,456 CPU cores.
Validated optimal convergence rates with laminar and turbulent flows.
Demonstrated applicability to DNS and LES of turbulent channel flow at high Reynolds numbers.
Abstract
We present an efficient discontinuous Galerkin scheme for simulation of the incompressible Navier-Stokes equations including laminar and turbulent flow. We consider a semi-explicit high-order velocity-correction method for time integration as well as nodal equal-order discretizations for velocity and pressure. The non-linear convective term is treated explicitly while a linear system is solved for the pressure Poisson equation and the viscous term. The key feature of our solver is a consistent penalty term reducing the local divergence error in order to overcome recently reported instabilities in spatially under-resolved high-Reynolds-number flows as well as small time steps. This penalty method is similar to the grad-div stabilization widely used in continuous finite elements. We further review and compare our method to several other techniques recently proposed in literature to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
