Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.00207

On general and complete multidimensional Riemann solvers for nonlinear systems of hyperbolic conservation laws

Elena Gaburro·Mario Ricchiuto·Michael Dumbser
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this work, we introduce a framework to design multidimensional Riemann solvers for nonlinear systems of hyperbolic conservation laws on general unstructured polygonal Voronoi-like tessellations. In this framework we propose two simple but complete solvers. The first method is a direct extension of the Osher-Solomon Riemann solver to multiple space dimensions. Here, the multidimensional numerical dissipation is obtained by integrating the absolute value of the flux Jacobians over a dual triangular mesh around each node of the primal polygonal grid. The required nodal gradient is then evaluated on a local computational simplex involving the d+1 neighbors meeting at each corner. The second method is a genuinely multidimensional upwind flux. By introducing a fluctuation form of finite volume methods with corner fluxes, we show an equivalence with residual distribution schemes (RD). This naturally allows to construct genuinely multidimensional upwind corner fluxes starting from existing and well-known RD fluctuations. In particular, we explore the use of corner fluxes obtained from the so-called N scheme, i.e. the Roe's original optimal multidimensional upwind advection scheme. Both methods use the full eigenstructure of the underlying hyperbolic system and are therefore complete by construction. A simple higher order extension up to fourth order in space and time is then introduced at the aid of a CWENO reconstruction in space and an ADER approach in time, leading to a family of high order accurate fully-discrete one-step schemes based on genuinely multidimensional Riemann solvers. We present applications of our new numerical schemes to several test problems for the compressible Euler equations of gas-dyanamics. In particular, we show that the proposed schemes are at the same time carbuncle-free and preserve certain stationary shear waves exactly.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Elena Gaburro, Mario Ricchiuto, Michael Dumbser. 2026-01-31. On general and complete multidimensional Riemann solvers for nonlinear systems of hyperbolic conservation laws. https://arxiv.org/abs/2506.00207

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↗