On the robustness and performance of entropy stable collocated discontinuous Galerkin methods

23Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In computational fluid dynamics, the demand for increasingly multidisciplinary reliable simulations, for both analysis and design optimization purposes, requires transformational advances in individual components of future solvers. At the algorithmic level, hardware compatibility and efficiency are of paramount importance in determining viability at exascale and beyond. However, equally important (if not more so) is algorithmic robustness with minimal user intervention, which becomes progressively more challenging to achieve as problem size and physics complexity increase. We numerically show that low and high order entropy stable collocated discontinuous Galerkin discretizations based on summation-by-part operators and simultaneous-approximation-terms technique provide an essential step toward a truly enabling technology in terms of reliability and robustness for both under-resolved turbulent flow simulations and flows with discontinuities.

Cite

CITATION STYLE

APA

Rojas, D., Boukharfane, R., Dalcin, L., Del Rey Fernández, D. C., Ranocha, H., Keyes, D. E., & Parsani, M. (2021). On the robustness and performance of entropy stable collocated discontinuous Galerkin methods. Journal of Computational Physics, 426. https://doi.org/10.1016/j.jcp.2020.109891

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free