Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2505.17057

Equilibrium-distribution-function based mesoscopic finite-difference methods for partial differential equations: Modeling and Analysis

Baochang shi·Rui Du·Zhenhua Chai
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, based on the idea of direct discrete modeling (DDM) with equilibrium distribution functions (EDFs), we develop a general framework of the mesoscopic numerical method (MesoNM) for macroscopic partial differential equations (PDEs), including but not limited to the nonlinear convection-diffusion equation (NCDE) and the Navier-Stokes equations (NSEs). Unlike the mesoscopic lattice Boltzmann method, this kind of MesoNM is an EDF-based mesoscopic finite-difference (MesoFD) method, and by taking the moments of the MesoFD scheme, its macroscopic version, called MMFD method, can be derived directly. Both MesoFD scheme and MMFD schemes are multi-level FD methods, MesoFD scheme being mesoscopic, and MMFD scheme being its macroscopic form which has the form of the central FD scheme. They are unified FD schemes for PDEs and can be in implicit or explicit forms as needed. The macroscopic moment equations (MEs) can be derived from the MesoFD or MMFD scheme through the Taylor expansion method, and the common PDEs can be recovered from the MEs by using the direct Taylor expansion method. Moreover, the stability of the MMFD scheme is analyzed for linear CDE and liner wave equation with anisotropic diffusion, and the stability conditions of a two-level explicit MMFD scheme, a two-level $θ$-MMFD scheme (hybrid explicit and implicit MMFD scheme), and a three-level MMFD scheme are obtained, respectively. Finally, we note that some existing lattice Boltzmann (LB) based macroscopic FD models for the NSEs and NCDE are the special cases of present MMFD, which can be considered as a unified framework of FD schemes for PDEs, from this point of view.

Explore related subjects

math.NAcs.NAphysics.flu-dyn

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Baochang shi, Rui Du, Zhenhua Chai. 2025-06-12. Equilibrium-distribution-function based mesoscopic finite-difference methods for partial differential equations: Modeling and Analysis. https://arxiv.org/abs/2505.17057

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↗