Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2007.08780

Kinetic functions for nonclassical shocks, entropy stability, and discrete summation by parts

Philippe G. LeFloch·Hendrik Ranocha
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study nonlinear hyperbolic conservation laws with non-convex flux in one space dimension and, for a broad class of numerical methods based on summation by parts operators, we compute numerically the kinetic functions associated with each scheme. As established by LeFloch and collaborators, kinetic functions (for continuous or discrete models) uniquely characterize the macro-scale dynamics of small-scale dependent, undercompressive, nonclassical shock waves. We show here that various entropy-dissipative numerical schemes can yield nonclassical solutions containing classical shocks, including Fourier methods with (super-) spectral viscosity, finite difference schemes with artificial dissipation, discontinuous Galerkin schemes with or without modal filtering, and TeCNO schemes. We demonstrate numerically that entropy stability does not imply uniqueness of the limiting numerical solutions for scalar conservation laws in one space dimension, and we compute the associated kinetic functions in order to distinguish between these schemes. In addition, we design entropy-dissipative schemes for the Keyfitz-Kranzer system whose solutions are measures with delta shocks. This system illustrates the fact that entropy stability does not imply boundedness under grid refinement.

Explore related subjects

math.NAcs.NAmath.AP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Philippe G. LeFloch, Hendrik Ranocha. 2021-04-07. Kinetic functions for nonclassical shocks, entropy stability, and discrete summation by parts. https://doi.org/10.1007/s10915-021-01463-6

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

KEEP EXPLORING

Related papers

arXiv2026

The Stability of Block Eliminations and Additive Modifications

The block elimination with additive modifications (BEAM) method was recently proposed as a alternative to LU with partial pivoting requiring less communication. Because of the novelty of BEAM, the existing theoretical analysis is lacking. To that end, we analyze both the numerical stability of the underlying block LU factorization and the effects of additive modifications. For the block LU factorization, we are able to improve the previous results of Demmel et al. from being cubic in the element growth to merely quadratic. Furthermore, we propose an alternative measure of element growth that is better aligned with block LU; this new measure of growth allows our analysis to apply to matrices that cannot be factored with pointwise LU. In the second part, we analyzed the modifications produced by BEAM and the effect they have on the condition number and growth factor. Finally, we show that BEAM will not apply any modifications in some cases that regular block LU can safely factor.

math.NA↗
arXiv2026

Efficient Rigorous Continuation via Chebyshev Series Expansion I

We study the global continuation of solution manifolds arising in dynamical systems. We present a rigorous continuation method based on a Chebyshev series expansion of the solution manifold. The branch is first approximated by a high-order Chebyshev interpolation polynomial, and an explicit error bound is then obtained by verifying the contraction of a quasi-Newton operator near this approximation. The contraction is formulated on a weighted $\ell^1$ space, giving a finer control than the typical $C^0$-error bound obtained from the uniform contraction theorem. In fact, the latter follows directly from our contraction operator. Furthermore, we discuss how our strategy applies naturally to pseudo-arclength continuation, where the continuation parameter fails to provide a valid local coordinate, and extends to multi-parameter continuation. Lastly, we detail two applications in which we compute a two-parameter family of steady-states for the Cahn--Hilliard equation, and a one-parameter family of steady-states undergoing saddle-node bifurcations for the Shigesada--Kawasaki--Teramoto system.

math.NA↗
arXiv2026

Efficient iterative techniques for solving tensor problems with the T-product

This paper develops two efficient iterative methods for solving tensor equations under the T-product framework. For T-symmetric positive definite tensor equations of the form $\mathcal{C} \star \mathcal{X} = \mathcal{D}$, we propose a conjugate-gradient-type algorithm that generates orthogonal residual and $\mathcal{C}$-orthogonal direction sequences, ensuring convergence within a finite number of steps. For general consistent tensor equations, we extend the method using a normal-equation transformation, and further adapt it to handle inconsistent systems by solving a least-squares minimization problem. Key advantages include direct tensor-based computations without explicit matrix expansion, rigorous finite-step convergence proofs, and the ability to obtain minimal Frobenius norm solutions. Numerical experiments on synthetic data, benchmark images, and video sequences demonstrate that the proposed algorithms achieve high precision with low computational time, confirming their practicality for large-scale multidimensional problems.

math.NA↗