Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2412.05399

Approximating Analytic Spectra of Hyperbolic Systems with Summation-by-Parts Finite Difference Operators

Brittany A. Erickson
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this work we explore the fidelity of numerical approximations to the analytic spectra of hyperbolic partial differential equation systems with variable coefficients. We are particularly interested in the ability of discrete methods to accurately discover sources of physical instabilities. By considering the perturbed equations that arise in linearized problems, we study systems in which a lower-order term can act as a source of internal energy within the system. We apply high-order accurate summation-by-parts finite difference operators, with weak enforcement of boundary conditions through the simultaneous-approximation-term technique, which leads to a provably stable numerical discretization with formal order of accuracy given by $p = 2, 3, 4$ and $5$. We derive analytic solutions using Laplace transform methods, which provide important ground truth to ensure numerical convergence at the correct theoretical rate. We derive the analytic spectrum and find that it is better captured with mesh refinement, although dissipative strict stability (where the growth rate of the discrete problem is bounded above by the analytic) is not obtained. We also find that sole reliance on mesh refinement can be a problematic means for determining physical growth rates as some eigenvalues emerge (and persist with mesh refinement) based on spatial order of accuracy but are non-physical. We suggest that numerical methods be used to approximate the spectra when numerical stability is guaranteed and convergence of the numerical spectra is evident with both mesh refinement and increasing order of accuracy.

Explore related subjects

math.NAcs.NAmath.AP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Brittany A. Erickson. 2025-08-11. Approximating Analytic Spectra of Hyperbolic Systems with Summation-by-Parts Finite Difference Operators. https://arxiv.org/abs/2412.05399

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↗