Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2411.07422

Impact of Numerical Fluxes on High Order Semidiscrete WENO-DeC Finite Volume Schemes

Lorenzo Micalizzi·Eleuterio F. Toro
View original source ↗Read source document ↗Export metadata ↓

Abstract

The numerical flux determines the performance of numerical methods for solving hyperbolic partial differential equations (PDEs). In this work, we compare a selection of 8 numerical fluxes in the framework of nonlinear semidiscrete finite volume (FV) schemes, based on Weighted Essentially Non-Oscillatory (WENO) spatial reconstruction and Deferred Correction (DeC) time discretization. The methodology is implemented and systematically assessed for order of accuracy in space and time up to seven. The numerical fluxes selected in the present study represent the two existing classes of fluxes, namely centred and upwind. Centred fluxes do not explicitly use wave propagation information, while, upwind fluxes do so from the solution of the Riemann problem via a wave model containing $A$ waves. Upwind fluxes include two subclasses: complete and incomplete fluxes. For complete upwind fluxes, $A=E$, where $E$ is the number of characteristic fields in the exact problem. For incomplete upwind ones, $A<E$. Our study is conducted for the one- and two-dimensional Euler equations, for which we consider the following numerical fluxes: Lax-Friedrichs (LxF), First-Order Centred (FORCE), Rusanov (Rus), Harten-Lax-van Leer (HLL), Central-Upwind (CU), Low-Dissipation Central-Upwind (LDCU), HLLC, and the flux computed through the exact Riemann solver (Ex.RS). We find that the numerical flux has an effect on the performance of the methods. The magnitude of the effect depends on the type of numerical flux and on the order of accuracy of the scheme. It also depends on the type of problem; that is, whether the solution is smooth or discontinuous, whether discontinuities are linear or nonlinear, whether linear discontinuities are fast- or slowly-moving, and whether the solution is evolved for short or long time.

Explore related subjects

math.NAcs.NAphysics.comp-ph

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Lorenzo Micalizzi, Eleuterio F. Toro. 2025-01-17. Impact of Numerical Fluxes on High Order Semidiscrete WENO-DeC Finite Volume Schemes. https://arxiv.org/abs/2411.07422

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↗