Design of Provably Physical-Constraint-Preserving Methods for General Relativistic Hydrodynamics

TL;DR

This paper develops high-order, provably physical-constraint-preserving numerical methods for general relativistic hydrodynamics, ensuring stability and robustness in simulations involving complex spacetime geometries.

Contribution

It introduces a new formulation of GRHD equations and proves the convexity and other properties of the admissible state set, enabling the design of high-order PCP schemes on unstructured meshes.

Findings

Proved convexity and Lax-Friedrichs splitting of the admissible state set.

Designed a first-order PCP scheme under a CFL condition.

Developed high-order PCP finite difference, finite volume, and DG methods.

Abstract

The paper develops high-order physical-constraint-preserving (PCP) methods for general relativistic hydrodynamic (GRHD) equations, equipped with a general equation of state. Here the physical constraints, describing the admissible states of GRHD, are referred to the subluminal constraint on the fluid velocity and the positivity of the density, pressure and specific internal energy. Preserving these constraints is very important for robust computations, otherwise violating one of them will lead to the ill-posed problem and numerical instability. To overcome the difficulties arising from the inherent strong nonlinearity contained in the constraints, we derive an equivalent definition of the admissible states. Using this definition, we prove the convexity, scaling invariance and Lax-Friedrichs (LxF) splitting property of the admissible state set $\mathcal G$, and discover the dependence of $\mathcal G$ on the spacetime metric. Unfortunately, such dependence yields the non-equivalence of $\mathcal G$ at different points in curved spacetime, and invalidates the convexity of $\mathcal G$ in analyzing PCP schemes. This obstacle is effectively overcame by introducing a new formulation of the GRHD equations. Based on this formulation and the above theories, a first-order LxF scheme is designed on general unstructured mesh and rigorously proved to be PCP under a CFL condition. With two types of PCP limiting procedures, we design high-order, {\em provably} (not probably) PCP methods under discretization on the proposed new formulation. These high-order methods include the PCP finite difference, finite volume and discontinuous Galerkin methods.