Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2605.25887

Well-Balanced Schemes for Hyperbolic Kinetic Relaxation

León Ávila·Manuel Castro·Victor Michel-Dansac·José M. Gallardo
View original source ↗Read source document ↗Export metadata ↓

Abstract

This work presents a novel family of well-balanced numerical schemes for hyperbolic systems of balance laws based on the kinetic relaxation approach. The method begins by transforming the original non-linear system into a linearized kinetic system with an increased number of variables. In this framework, non-linearities are shifted to the source term, and the connection to the macroscopic variables is maintained via a projection operator related to the Maxwellian equilibrium states. These relaxed systems are typically solved using splitting techniques, where the evolution is decomposed into two distinct steps: first, the transport stage solving the source-free kinetic system, and second, the relaxation stage governed by an ordinary differential equation where the time derivative is balanced by the kinetic source term. The primary objective is to design schemes that accurately preserve the steady-state solutions of the original macroscopic equations, noting that these do not necessarily coincide with the trivial equilibria of the relaxed system. This well-balanced property is achieved through an appropriate formulation of the kinetic system combined with consistent reconstruction operators. This approach ensures that the balance is maintained throughout both the transport stage and the projection stage, where the treatment of the macroscopic source term is carefully integrated. We demonstrate that this framework can be implemented using both Finite Volume (FV) and Semi-Lagrangian (SL) techniques in the transport step. We develop and analyze these schemes for the Finite Volume case in both explicit and implicit formulations. Results are validated through numerical benchmarks, including the Burgers equation with a source term, 1D Shallow Water Equations (SWE) with bathymetry preserving non-trivial moving water equilibria and the Euler equations under external potentials.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

León Ávila, Manuel Castro, Victor Michel-Dansac, José M. Gallardo. 2026-05-25. Well-Balanced Schemes for Hyperbolic Kinetic Relaxation. https://arxiv.org/abs/2605.25887

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

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗