Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2408.10214

A Memory Reduction Compact Gas Kinetic Scheme on 3D Unstructured Meshes

Hongyu Liu·Xing Ji·Yunpeng Mao·Zhe Qian·Kun Xu
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper introduces a memory-reduction third-order compact gas-kinetic scheme (CGKS) for solving compressible Euler and Navier-Stokes equations on 3D unstructured meshes. The scheme utilizes a time-evolution gas distribution function to provide a time-evolution solution at cell interfaces, enabling the implementation of Hermite WENO techniques for high-order reconstruction. However, the HWENO method needs to store a coefficients matrix for the quadratic polynomial to achieve third-order accuracy, resulting in high memory usage. A novel reconstruction method, built upon HWENO reconstruction, has been designed to enhance computational efficiency and reduce memory usage compared to the original CGKS. The simple idea is that the first-order and second-order terms of the quadratic polynomials are determined in a two-step way. In the first step, the second-order terms are obtained from the reconstruction of a linear polynomial of the first-order derivatives by only using the cell-averaged slopes, since the second-order derivatives are nothing but the "derivatives of derivatives". Subsequently, the first-order terms left can be determined by the linear reconstruction only using cell-averaged values. Thus, we successfully split one quadratic least-square regression into several linear least-square regressions, which are commonly used in a second-order finite volume code. Since only a small matrix inversion is needed in a 3-D linear least-square regression, the computational cost for the new reconstruction is dramatically reduced and the storage of the reconstruction-coefficient matrix is no longer necessary. The proposed new reconstruction technique can reduce the overall computational cost by about 20 to 30 percent. The challenging large-scale unsteady numerical simulation is performed, which demonstrates that the current improvement brings the CGKS to a new level for industrial applications.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hongyu Liu, Xing Ji, Yunpeng Mao, Zhe Qian, Kun Xu. 2024-07-22. A Memory Reduction Compact Gas Kinetic Scheme on 3D Unstructured Meshes. https://arxiv.org/abs/2408.10214

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↗