Search arXivSearch

arXiv · 2510.08134

Semi-Implicit Central scheme for Hyperbolic Systems of Balance Laws with Relaxed Source Term

Abstract

Quasi-linear hyperbolic systems with source terms introduce significant computational challenges due to the presence of a stiff source term. To address this, a finite volume Nessyahu-Tadmor (NT) central numerical scheme is explored and applied to benchmark models such as the Jin-Xin relaxation model, the shallow-water model, the Broadwell model, the Euler equations with heat transfer, and the Euler system with stiff friction to assess their effectiveness. The core part of this numerical scheme lies in developing a new implicit-explicit (IMEX) scheme, where the stiff source term is handled in a semi-implicit manner constructed by combining the midpoint rule in space, the trapezoidal rule in time with a backward semi-implicit Taylor expansion. The advantage of the proposed method lies in its stability region and maintains robustness near stiffness and discontinuities, while asymptotically preserving second-order accuracy. The numerical validation further extends to two-dimensional configurations of the Jin-Xin relaxation model and a Jin-Xin-type relaxation system of 2D Euler equation. Theoretical analysis and numerical validation confirm the stability and accuracy of the method, highlighting its potential for efficiently solving the stiff hyperbolic systems of balance laws of 1D and 2D.

Explore related subjects

Keep this discovery

BibTeXRIS

Sudipta Sahu, Emanuele Macca, Rathan Samala. 2026-03-27. Semi-Implicit Central scheme for Hyperbolic Systems of Balance Laws with Relaxed Source Term. https://doi.org/10.1016/j.jcp.2026.115100

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

Numerical experiments on the Hardy conjecture for the Gauss circle problem

The classical unsolved Gauss circle problem concerns estimating the error between the number of lattice points inside a circle and the area of the circle as its radius tends to infinity. About a century ago, Hardy proposed a conjecture concerning this problem. In this paper, we attempt to provide numerical evidence in support of the Hardy conjecture through large-scale numerical computations.

math.NT

Advancements in Spectral Collocation Methods for High-Order Eigenvalue Problems

This paper focuses on computing spectral solutions for high-order eigenvalue problems using an efficient discretization method based on Chebfun spectral discretization algorithms and domain truncation. We solve several numerical eigenvalue problems, demonstrating both the accuracy and computational efficiency of the proposed approach.

math.NA

$L^p$-Convergence Rate of Backward Euler Schemes for Monotone SDEs

We give a unified method to derive the strong convergence rate of the backward Euler scheme for monotone SDEs in $L^p(Ω)$-norm, with general $p \ge 4$. The results are applied to the backward Euler scheme of SODEs with polynomial growth coefficients. We also generalize the argument to the Galerkin-based backward Euler scheme of SPDEs with polynomial growth coefficients driven by multiplicative trace-class noise.

math.NA