Metraipolis › archive › dc_91a198124bb9

High-order fully discrete multi-entropy-stable and bound-preserving schemes for relativistic Euler equations — arXiv:2608.09327

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.09327
License (as archived)
CC0-1.0
Archived
2026-10-19T09:08:03.736Z
SHA-256 of the archived text
44041c76bf54279f4d819c630789fd36e97be88299f4d324d319c10c00bb2a03
Stable URL of this page
https://metraipolis.com/documento/dc_91a198124bb9

How to cite

High-order fully discrete multi-entropy-stable and bound-preserving schemes for relativistic Euler equations — arXiv:2608.09327 — arXiv (en), https://arxiv.org/abs/2608.09327 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_91a198124bb9 (Metraipolis archive dc_91a198124bb9, sha256 44041c76bf54279f4d819c630789fd36e97be88299f4d324d319c10c00bb2a03)
BibTeX
@misc{dc91a198124bb9,
  title = {High-order fully discrete multi-entropy-stable and bound-preserving schemes for relativistic Euler equations — arXiv:2608.09327},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.09327},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_91a198124bb9; sha256 44041c76bf54279f4d819c630789fd36e97be88299f4d324d319c10c00bb2a03},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.09327. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A discrete entropy inequality is the principal nonlinear stability estimate available for systems of conservation laws, and evaluating it presupposes a physically admissible state. So far, however, the two have been secured separately. Entropy-stable schemes are almost always semi-discrete, are built around one selected entropy pair, and take for granted the positivity of density and pressure that makes the entropy well defined in the first place, whereas bound-preserving limiters keep the solution admissible but deliver no entropy estimate. For the special relativistic Euler equations, the two cannot be separated at all, since the conservative-to-primitive map is implicit, and an inadmissible state therefore has no entropy to correct. Here we construct high-order discontinuous Galerkin and finite volume schemes that, to our knowledge, for the first time, are entropy stable in the fully discrete sense for an arbitrary prescribed finite family of convex entropy pairs, a property we call multi-entropy stability, and are provably admissible wherever an entropy is evaluated. All of this is achieved by a single cellwise projection, and neither conservation nor the design order is lost. The construction rests on relativistic causality, which bounds every characteristic speed by the speed of light. Consequently, the numerical viscosity can be fixed once for all states and all equations of state, and one two-point building block then serves the whole entropy family. Since only the convexity of the admissible set and this speed bound are used, the same route remains open for related systems. Finally, in computations with four equations of state, the schemes retain high-order accuracy close to vacuum, produce no inadmissible state in strong shocks, near-vacuum shock--vortex interaction or jets with Lorentz factor above $70$, and confirm the monotone decay of every enforced discrete entropy.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.NA).
Categorie arXiv: Numerical Analysis (math.NA) ; Instrumentation and Methods for Astrophysics (astro-ph.IM); Computational Physics (physics.comp-ph); Fluid Dynamics (physics.flu-dyn).
Pagina del lavoro: https://arxiv.org/abs/2608.09327 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:05:02.973Z dalla pagina https://arxiv.org/catchup/math.NA/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).