Papers
Topics
Authors
Recent
Search
2000 character limit reached

Fully-Discretely Nonlinearly-Stable Flux Reconstruction Methods for Compressible Flows

Published 30 Aug 2024 in math.NA and cs.NA | (2409.00208v1)

Abstract: A fully-discrete, nonlinearly-stable flux reconstruction (FD-NSFR) scheme is developed, which ensures robustness through entropy stability in both space and time for high-order flux reconstruction schemes. We extend the entropy-stable flux reconstruction semidiscretization of Cicchino et al. [1,2,3] with the relaxation Runge Kutta method to construct the FD-NSFR scheme. We focus our study on entropy-stable flux reconstruction methods, which allow a larger time step size than discontinuous Galerkin. In this work, we develop an FD-NSFR scheme that prevents temporal numerical entropy change in the broken Sobolev norm if the governing equations admit a convex entropy function that can be expressed in inner-product form. For governing equations with a general convex numerical entropy function, temporal entropy change in the physical $L_2$ norm is prevented. As a result, for general convex numerical entropy, the FD-NSFR scheme achieves fully-discrete entropy stability only when the DG correction function is employed. We use entropy-conserving and entropy-stable test cases for the Burgers', Euler, and Navier-Stokes equations to demonstrate that the FD-NSFR scheme prevents temporal numerical entropy change. The FD-NSFR scheme therefore allows for a larger time step size while maintaining the robustness offered by entropy-stable schemes. We find that the FD-NSFR scheme is able to recover both integrated quantities and solution contours at a higher target time-step size than the semi-discretely entropy-stable scheme, suggesting a robustness advantage for low-Mach turbulence simulations.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.