Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.09615

A novel compact scheme for second-order fluxes applied to the Spectral Difference method

Guido Lodato·Niccolò Tonicello
View original source ↗Read source document ↗Export metadata ↓

Abstract

The discretization of second-order (viscous) terms in Discontinuous Spectral Element Methods (DSEMs) typically relies on an auxiliary gradient variable, whose treatment at element interfaces affects the accuracy and stability of the scheme. The Bassi-Rebay (BR1) formulation is attractive for its simplicity and parameter-free character, but suffers from sub-optimal convergence at even polynomial orders and requires an extended five-element stencil. Inspired by Huynh's Flux Reconstruction formulation, we develop a compact, fully-centered scheme for second-order fluxes within the Spectral Difference (SD) method. The proposed approach modifies the reconstruction of the auxiliary gradient using interface-dependent, one-sided continuous fluxes, reducing the stencil from five to three elements while preserving the centered and parameter-free nature of BR1. The formulation is developed in one dimension and extended to multiple dimensions. Temporal eigenanalysis is used to characterize its dissipation and dispersion properties, including the effects of interior penalty terms. Numerical tests consider the linear diffusion equation, an under-resolved localized Dirac's delta, the nonlinear porous medium equation, and implicit large-eddy simulations of the three-dimensional Taylor-Green vortex at $\mathrm{Re}=1600$ and $5000$. The compact scheme restores the expected convergence order for all polynomial degrees, including even orders, and reduces spurious oscillations in under-resolved and nonlinear regimes. It also remains stable in turbulent cases where the standard formulation fails, owing to improved damping of high-wavenumber numerical modes. The proposed approach provides an attractive compact alternative to BR1 for second-order fluxes in the SD method.

Explore related subjects

math.NAcs.NAphysics.flu-dyn

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Guido Lodato, Niccolò Tonicello. 2026-08-10. A novel compact scheme for second-order fluxes applied to the Spectral Difference method. https://arxiv.org/abs/2608.09615

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↗