arXiv subjects

Shengrong Ding

Publications and source records attributed to Shengrong Ding.

8 recordsLinked to original sources

arXiv2026

Invariant domain preservation for hybrid point-value and cell-average discretizations of hyperbolic equations on general meshes

This paper presents a unified invariant-domain-preserving (IDP) framework for hybrid discretizations of hyperbolic conservation laws, including active flux and PAMPA methods, in which cell averages are updated conservatively while cell-boundary point values evolve under a possibly non-conservative operator. The main challenge is to preserve admissibility for these two coupled sets of states under a single local stability condition, without adding evolved degrees of freedom or relying on post-update repairs. For the point-value update, we introduce an admissibility transform based on a barrier--Legendre map for convex admissible interiors described by concave constraints, and prove that the inverse map is globally defined and Lipschitz continuous on the relevant sets. For the conservative cell-average update, we establish a structural obstruction theorem: the single-state continuous physical flux built from admissible boundary traces alone cannot provide a conservative IDP guarantee, for any prescribed CFL number, when internal reconstruction values are uncontrolled. This identifies the missing local control that must be supplied by an additional IDP flux mechanism. To realize this mechanism explicitly, we combine cell average decompositions (CAD), geometric quasilinearization, and local a priori scaling to construct admissible, generally discontinuous trace states before flux evaluation. Under an explicit trace-based CFL condition, with constants determined by local CAD weights and trace-state wave-speed bounds, the coupled hybrid update preserves the prescribed invariant domain. Concrete third-order schemes are developed on triangular, Cartesian, convex quadrilateral, and general convex polygonal meshes. Numerical results demonstrate the designed order of accuracy for smooth solutions and the strict preservation of physical admissibility.

math.NA↗

arXiv2026

GQL-Based Physical-Constraint-Preserving High-Order Finite Difference Schemes for Special Relativistic Hydrodynamics in Arbitrary Dimensions

High-order accurate simulations of special relativistic hydrodynamics (RHD) are prone to numerical breakdown if intrinsic physical constraints (positive rest-mass density/pressure and subluminal velocity) are violated near strong discontinuities. In this work, we develop a robust and efficient physical-constraint-preserving (PCP) flux-limiting framework for high-order schemes, using finite-difference WENO as a representative example. By leveraging the geometric quasilinearization (GQL) representation, which equivalently reformulates the nonlinear RHD constraints into a family of linear inequalities, we integrate a Zalesak-type Flux-Corrected Transport (FCT) update into a scalar-style limiter that acts directly on conservative variables. A critical innovation is the explicit, non-iterative determination of limiting parameters via a rational stereographic parameterization of the GQL normal vector. This technique transforms the required worst-case minimization over auxiliary variables into a generalized Rayleigh-quotient formulation, allowing the optimal parameters to be obtained by solving small symmetric eigenvalue problems ($2\times2$ in 1D; $(d+1)\times(d+1)$ in $d$ dimensions). Relaxed variants are further introduced to reduce computational costs in multidimensions while retaining the PCP guarantee. Extensive numerical benchmarks ranging from 1D to 3D, including ultra-relativistic Riemann problems and astrophysical jets, demonstrate that the proposed method robustly enforces physical admissibility, sharply resolves discontinuities, and maintains design-order accuracy for smooth solutions.

math.NA↗

arXiv2024

High-order Accurate Entropy Stable Schemes for Relativistic Hydrodynamics with General Synge-type Equation of State

All the existing entropy stable (ES) schemes for relativistic hydrodynamics (RHD) in the literature were restricted to the ideal equation of state (EOS), which however is often a poor approximation for most relativistic flows due to its inconsistency with the relativistic kinetic theory. This paper develops high-order ES finite difference schemes for RHD with general Synge-type EOS, which encompasses a range of special EOSs. We first establish an entropy pair for the RHD equations with general Synge-type EOS in any space dimensions. We rigorously prove that the found entropy function is strictly convex and derive the associated entropy variables, laying the foundation for designing entropy conservative (EC) and ES schemes. Due to relativistic effects, one cannot explicitly express primitive variables, fluxes, and entropy variables in terms of conservative variables. Consequently, this highly complicates the analysis of the entropy structure of the RHD equations, the investigation of entropy convexity, and the construction of EC numerical fluxes. By using a suitable set of parameter variables, we construct novel two-point EC fluxes in a unified form for general Synge-type EOS. We obtain high-order EC schemes through linear combinations of the two-point EC fluxes. Arbitrarily high-order accurate ES schemes are achieved by incorporating dissipation terms into the EC schemes, based on (weighted) essentially non-oscillatory reconstructions. Additionally, we derive the general dissipation matrix for general Synge-type EOS based on the scaled eigenvectors of the RHD system. We also define a suitable average of the dissipation matrix at the cell interfaces to ensure that the resulting ES schemes can resolve stationary contact discontinuities accurately. Several numerical examples are provided to validate the accuracy and effectiveness of our schemes for RHD with four special EOSs.

math.NA↗

arXiv2024

Robust DG Schemes on Unstructured Triangular Meshes: Oscillation Elimination and Bound Preservation via Optimal Convex Decomposition

Discontinuous Galerkin (DG) schemes on unstructured meshes offer the advantages of compactness and the ability to handle complex computational domains. However, their robustness and reliability in solving hyperbolic conservation laws depend on two critical abilities: suppressing spurious oscillations and preserving intrinsic bounds or constraints. This paper introduces two significant advancements in enhancing the robustness and efficiency of DG methods on unstructured meshes for general hyperbolic conservation laws, while maintaining their accuracy and compactness. First, we investigate the oscillation-eliminating (OE) DG methods on unstructured meshes. These methods not only maintain key features such as conservation, scale invariance, and evolution invariance but also achieve rotation invariance through a novel rotation-invariant OE (RIOE) procedure. Second, we propose, for the first time, the optimal convex decomposition for designing efficient bound-preserving (BP) DG schemes on unstructured meshes. Finding the optimal convex decomposition that maximizes the BP CFL number is an important yet challenging problem.While this challenge was addressed for rectangular meshes, it remains an open problem for triangular meshes. This paper successfully constructs the optimal convex decomposition for the widely used $P^1$ and $P^2$ spaces on triangular cells, significantly improving the efficiency of BP DG methods.The maximum BP CFL numbers are increased by 100%--200% for $P^1$ and 280.38%--350% for $P^2$, compared to classic decomposition. Furthermore, our RIOE procedure and optimal decomposition technique can be integrated into existing DG codes with little and localized modifications. These techniques require only edge-neighboring cell information, thereby retaining the compactness and high parallel efficiency of original DG methods.

math.NA↗

arXiv2024

GQL-Based Bound-Preserving and Locally Divergence-Free Central Discontinuous Galerkin Schemes for Relativistic Magnetohydrodynamics

This paper develops novel and robust central discontinuous Galerkin (CDG) schemes of arbitrarily high-order accuracy for special relativistic magnetohydrodynamics (RMHD) with a general equation of state (EOS). These schemes are provably bound-preserving (BP), i.e., consistently preserve the upper bound for subluminal fluid velocity and the positivity of density and pressure, while also (locally) maintaining the divergence-free (DF) constraint for the magnetic field. For 1D RMHD, the standard CDG method is exactly DF, and its BP property is proven under a condition achievable by BP limiter. For 2D RMHD, we design provably BP and locally DF CDG schemes based on the suitable discretization of a modified RMHD system. A key novelty in our schemes is the discretization of additional source terms in the modified RMHD equations, so as to precisely counteract the influence of divergence errors on the BP property across overlapping meshes. We provide rigorous proofs of the BP property for our CDG schemes and first establish the theoretical connection between BP and discrete DF properties on overlapping meshes for RMHD. Owing to the absence of explicit expressions for primitive variables in terms of conserved variables, the constraints of physical bounds are strongly nonlinear, making the BP proofs highly nontrivial. We overcome these challenges through technical estimates within the geometric quasilinearization (GQL) framework, which converts the nonlinear constraints into linear ones. Furthermore, we introduce a new 2D cell average decomposition on overlapping meshes, which relaxes the theoretical BP CFL constraint and reduces the number of internal nodes, thereby enhancing the efficiency of the 2D BP CDG method. We implement the proposed CDG schemes for extensive RMHD problems with various EOSs, demonstrating their robustness and effectiveness in challenging scenarios.

math.NA↗

arXiv2023

A new discretely divergence-free positivity-preserving high-order finite volume method for ideal MHD equations

This paper proposes and analyzes a novel efficient high-order finite volume method for the ideal magnetohydrodynamics (MHD). As a distinctive feature, the method simultaneously preserves a discretely divergence-free (DDF) constraint on the magnetic field and the positivity-preserving (PP) property, which ensures the positivity of density, pressure, and internal energy. To enforce the DDF condition, we design a new discrete projection approach that projects the reconstructed point values at the cell interface into a DDF space, without using any approximation polynomials. This projection method is highly efficient, easy to implement, and particularly suitable for standard high-order finite volume WENO methods, which typically return only the point values in the reconstruction. Moreover, we also develop a new finite volume framework for constructing provably PP schemes for the ideal MHD system. The framework comprises the discrete projection technique, a suitable approximation to the Godunov--Powell source terms, and a simple PP limiter. We provide rigorous analysis of the PP property of the proposed finite volume method, demonstrating that the DDF condition and the proper approximation to the source terms eliminate the impact of magnetic divergence terms on the PP property. The analysis is challenging due to the internal energy function's nonlinearity and the intricate relationship between the DDF and PP properties. To address these challenges, the recently developed geometric quasilinearization approach is adopted, which transforms a nonlinear constraint into a family of linear constraints. Finally, we validate the effectiveness of the proposed method through several benchmark and demanding numerical examples. The results demonstrate that the proposed method is robust, accurate, and highly effective, confirming the significance of the proposed DDF projection and PP techniques.

math.NA↗

arXiv2022

On Optimal Cell Average Decomposition for High-Order Bound-Preserving Schemes of Hyperbolic Conservation Laws

This paper presents the first systematic study on the fundamental problem of seeking optimal cell average decomposition (OCAD), which arises from constructing efficient high-order bound-preserving (BP) numerical methods within Zhang--Shu framework. Since proposed in 2010, Zhang--Shu framework has attracted extensive attention and been applied to developing many high-order BP discontinuous Galerkin and finite volume schemes for various hyperbolic equations. An essential ingredient in the framework is the decomposition of the cell averages of the numerical solution into a convex combination of the solution values at certain quadrature points. The classic CAD originally proposed by Zhang and Shu has been widely used in the past decade. However, the feasible CADs are not unique, and different CAD would affect the theoretical BP CFL condition and thus the computational costs. Zhang and Shu only checked, for the 1D $\mathbb P^2$ and $\mathbb P^3$ spaces, that their classic CAD based on the Gauss--Lobatto quadrature is optimal in the sense of achieving the mildest BP CFL conditions. In this paper, we establish the general theory for studying the OCAD problem on Cartesian meshes in 1D and 2D. We rigorously prove that the classic CAD is optimal for general 1D $\mathbb P^k$ spaces and general 2D $\mathbb Q^k$ spaces of arbitrary $k$. For the widely used 2D $\mathbb P^k$ spaces, the classic CAD is not optimal, and we establish the general approach to find out the genuine OCAD and propose a more practical quasi-optimal CAD, both of which provide much milder BP CFL conditions than the classic CAD. As a result, our OCAD and quasi-optimal CAD notably improve the efficiency of high-order BP schemes for a large class of hyperbolic or convection-dominated equations, at little cost of only a slight and local modification to the implementation code.

math.NA↗

arXiv2022

Is the Classic Convex Decomposition Optimal for Bound-Preserving Schemes in Multiple Dimensions?

Since proposed in [X. Zhang and C.-W. Shu, J. Comput. Phys., 229: 3091--3120, 2010], the Zhang--Shu framework has attracted extensive attention and motivated many bound-preserving (BP) high-order discontinuous Galerkin and finite volume schemes for various hyperbolic equations. A key ingredient in the framework is the decomposition of the cell averages of the numerical solution into a convex combination of the solution values at certain quadrature points, which helps to rewrite high-order schemes as convex combinations of formally first-order schemes. The classic convex decomposition originally proposed by Zhang and Shu has been widely used over the past decade. It was verified, only for the 1D quadratic and cubic polynomial spaces, that the classic decomposition is optimal in the sense of achieving the mildest BP CFL condition. Yet, it remained unclear whether the classic decomposition is optimal in multiple dimensions. In this paper, we find that the classic multidimensional decomposition based on the tensor product of Gauss--Lobatto and Gauss quadratures is generally not optimal, and we discover a novel alternative decomposition for the 2D and 3D polynomial spaces of total degree up to 2 and 3, respectively, on Cartesian meshes. Our new decomposition allows a larger BP time step-size than the classic one, and moreover, it is rigorously proved to be optimal to attain the mildest BP CFL condition, yet requires much fewer nodes. The discovery of such an optimal convex decomposition is highly nontrivial yet meaningful, as it may lead to an improvement of high-order BP schemes for a large class of hyperbolic or convection-dominated equations, at the cost of only a slight and local modification to the implementation code. Several numerical examples are provided to further validate the advantages of using our optimal decomposition over the classic one in terms of efficiency.

math.NA↗