High-order limiting methods using maximum principle bounds derived from the Boltzmann equation I: Euler equations
Tarik Dzanic, Luigi Martinelli

TL;DR
This paper introduces a novel kinetic-based method for computing solution bounds and limiting in high-order Euler equation simulations, improving robustness and accuracy in complex gas dynamics problems.
Contribution
It develops an analytic approach to derive admissible solution bounds from the Boltzmann equation, extending limiters for linear advection to the Euler equations.
Findings
Preserves positivity of physical quantities.
Robustly resolves strong shocks and discontinuities.
Achieves high-order accuracy in smooth regions.
Abstract
The use of limiting methods for high-order numerical approximations of hyperbolic conservation laws generally requires defining an admissible region/bounds for the solution. In this work, we present a novel approach for computing solution bounds and limiting for the Euler equations through the kinetic representation provided by the Boltzmann equation, which allows for extending limiters designed for linear advection directly to the Euler equations. Given an arbitrary set of solution values to compute bounds over (e.g., numerical stencil) and a desired linear advection limiter, the proposed approach yields an analytic expression for the admissible region of particle distribution function values, which may be numerically integrated to yield a set of bounds for the density, momentum, and total energy. These solution bounds are shown to preserve positivity of density/pressure/internal…
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.
Taxonomy
TopicsModel Reduction and Neural Networks · Electromagnetic Simulation and Numerical Methods · Advanced Numerical Methods in Computational Mathematics
