Search arXivSearch

arXiv · 2609.12506

Normal Equations and Discrete Energy Structures for High-Order Streamline Diffusion

Abstract

We analyse fully discrete Streamline Diffusion finite element methods, also known as SUPG methods, for time-dependent first-order systems with skew-symmetric spatial operators. To the best of our knowledge, this is the first stability and a priori error analysis of strongly consistent Streamline Diffusion finite elements combined with linear multistep schemes of order greater than two for multidimensional first-order hyperbolic systems. Local-in-time $L^2$-residual minimisation singles out $δ=b_0τ$, where $δ$ is the stabilisation parameter, $τ$ the time step, and $b_0$ the current-time coefficient in the method average. For this choice, each implicit linear system is a symmetric positive definite normal equation in a graph norm. A direct dual-residual estimate yields errors of order $O(h^{k+1/2}+τ^ν)$ when $δ$ is proportional to $h$ and $τ=O(h)$, where $h$ is the mesh size, $k$ the polynomial degree, and $ν$ the temporal order. Stability is established for the $θ$-method and the Adams-Moulton methods AM3-AM5. The general-degree AM3 and AM4 estimates use strengthened CFL conditions; for continuous piecewise affine elements, an elementwise cancellation recovers the standard hyperbolic regime. AM5 and the explicit Adams-Bashforth methods AB3 and AB4 are stable under a standard hyperbolic CFL condition, though the explicit schemes do not have normal-equation structure. Order-matched acoustic tests recover orders two through five and material-residual rates one half-order lower. In a d'Alembert test with discontinuous initial data, normal-equation SUPG recovers second-order local $\mathbb P_1$ convergence away from the wave fronts, whereas the unstabilised error is close to half order. A two-dimensional compact-wave test shows improved localisation with modest dissipation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Erik Burman, Peter Hansbo, Mats G. Larson. 2026-09-11. Normal Equations and Discrete Energy Structures for High-Order Streamline Diffusion. https://arxiv.org/abs/2609.12506

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

KEEP EXPLORING

Related papers

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

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

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