Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2506.16076

General-domain FC-based shock-dynamics solver I: Basic elements

Oscar P. Bruno·Daniel V. Leibovici
View original source ↗Read source document ↗Export metadata ↓

Abstract

This contribution, Part I in a two-part article series, presents a general-domain version of the FC-SDNN (Fourier Continuation Shock-detecting Neural Network) spectral scheme for the numerical solution of nonlinear conservation laws, which is applicable under arbitrary boundary conditions and in general domains. Like the previous simple-domain contribution (Journal of Computational Physics X 15, (2022)), the present approach relies on the use of the Fourier Continuation method for accurate spectral representation of non-periodic functions in conjunction with smooth artificial viscosity assignments localized in regions detected by means of a Shock-Detecting Neural Network (SDNN). Relying on such techniques, the present Part I paper introduces a novel multi-patch/subpatch artificial viscosity-capable domain decomposition strategy for complex domains with smooth boundaries, and it illustrates the methodology by means of a variety of computational results produced by an associated parallel implementation of the resulting shock-capturing algorithm in a present-day computing cluster. The subsequent Part II contribution then extends the algorithm to enable treatment of obstacles with non-smooth boundaries, it considers questions concerning parallelization and accuracy, and it presents comparisons with physical theory and prior experimental and computational results. The resulting multi-patch FC-SDNN algorithm does not require use of problem-dependent algorithmic parameters or positivity-preserving limiters, and, on account of its use of an overlapping-patch discretization, it is geometrically flexible and efficiently parallelized. A variety of numerical tests for the 2D Euler equations are presented, including the simulation of supersonic and hypersonic flows and shocks past physical obstacles at high speeds, such as Mach 25 re-entry flow speeds.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Oscar P. Bruno, Daniel V. Leibovici. 2025-06-19. General-domain FC-based shock-dynamics solver I: Basic elements. https://arxiv.org/abs/2506.16076

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↗