Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2405.12301

Tensor-Train WENO Scheme for Compressible Flows

Mustafa Engin Danis·Duc Truong·Ismael Boureima·Oleg Korobkin·Kim Rasmussen·Boian Alexandrov
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this study, we introduce a tensor-train (TT) finite difference WENO method for solving compressible Euler equations. In a step-by-step manner, the tensorization of the governing equations is demonstrated. We also introduce \emph{LF-cross} and \emph{WENO-cross} methods to compute numerical fluxes and the WENO reconstruction using the cross interpolation technique. A tensor-train approach is developed for boundary condition types commonly encountered in Computational Fluid Dynamics (CFD). The performance of the proposed WENO-TT solver is investigated in a rich set of numerical experiments. We demonstrate that the WENO-TT method achieves the theoretical $\text{5}^{\text{th}}$-order accuracy of the classical WENO scheme in smooth problems while successfully capturing complicated shock structures. In an effort to avoid the growth of TT ranks, we propose a dynamic method to estimate the TT approximation error that governs the ranks and overall truncation error of the WENO-TT scheme. Finally, we show that the traditional WENO scheme can be accelerated up to 1000 times in the TT format, and the memory requirements can be significantly decreased for low-rank problems, demonstrating the potential of tensor-train approach for future CFD application. This paper is the first study that develops a finite difference WENO scheme using the tensor-train approach for compressible flows. It is also the first comprehensive work that provides a detailed perspective into the relationship between rank, truncation error, and the TT approximation error for compressible WENO solvers.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mustafa Engin Danis, Duc Truong, Ismael Boureima, Oleg Korobkin, Kim Rasmussen, Boian Alexandrov. 2024-05-20. Tensor-Train WENO Scheme for Compressible Flows. https://arxiv.org/abs/2405.12301

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↗