Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.10809

A compact simple HWENO scheme with ADER time discretization for hyperbolic conservation laws II: triangular meshes

Dongmi Luo·Zhuang Zhao·Jianxian Qiu·Yibing Chen
View original source ↗Read source document ↗Export metadata ↓

Abstract

A compact and high order HWENO scheme using ADER (Arbitrary high order using DERivatives) time discretization is developed for hyperbolic conservation laws on the triangular mesh, which is the extension of the work on the structured mesh (Luo et. al. (2024) \cite{luo2023}). The Lax-Wendroff procedure is employed to convert time derivatives to spatial derivatives. Thanks to this, the cell averages of the derivatives of the solution can be obtained by the time accurate solution as Gaussian points along the cell interfaces through the Green-Gauss theorem instead of by the evolution solution directly in the conventional HWENO methods. Comparing with the existing Runge-Kutta HWENO (RK-HWENO) method on the unstructured mesh (Zhao et. al. (2025) \cite{zhao2025}), the new method has the following advantages. Firstly, the RK-HWENO method must solve the additional equations for reconstructions and time advancing, which is avoided for the new method. Secondly, the HWENO reconstruction in the new method is performed once per time step and is different from the RK-HWENO method, in which the reconstruction is performed several times every time step. Because of these advantages the new method is more efficient than the RK-HWENO method with smaller numerical errors and less computational costs. Besides, comparing with the existing ADER-WENO methods \cite{dumbser20071,dumbser20072} under the same order of accuracy, the stencil of the new method is more compact since the both the function and its first derivative values are used in the reconstruction of the HWENO schemes. Numerical examples demonstrate that the new method can achieve the high order for smooth solutions both in space and time, keep non-oscillatory near discontinuities.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dongmi Luo, Zhuang Zhao, Jianxian Qiu, Yibing Chen. 2026-07-12. A compact simple HWENO scheme with ADER time discretization for hyperbolic conservation laws II: triangular meshes. https://arxiv.org/abs/2607.10809

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↗