Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2503.06817

An automatic approach to develop the fourth-order and L^2-stable lattice Boltzmann model for diagonal-anisotropic diffusion equations

Ying Chen·Zhenhua Chai·Baochang Shi
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper discusses how to develop a high-order multiple-relaxation-time lattice Boltzmann (MRT-LB) model for the general d(>=1)-dimensional diagonal-anisotropic diffusion equation. Such an MRT-LB model considers the transformation matrix constructed in a natural way and the DdQ(2d^2+1) lattice structure. A key step in developing the high-order MRT-LB model is to determine the adjustable relaxation parameters and weight coefficients, which are used to eliminate the truncation errors at certain orders of the MRT-LB model, while ensuring the stability of the MRT-LB model. In this work, we first present a unified MRT-LB model for the diagonal-anisotropic diffusion equation. Then, through the direct Taylor expansion, we analyze the macroscopic modified equations of the MRT-LB model up to fourth-order, and further derive the fourth-order consistent conditions of the MRT-LB model. Additionally, we also construct the fourth-order initialization scheme for the present LB method. After that, the condition which guarantees that the MRT-LB model can satisfy the stability structure is explicitly given, and from a numerical perspective, once the stability structure is satisfied, the MRT-LB model must be L^2 stable. In combination with the fourth-order consistent and L^2 stability conditions, the relaxation parameters and weight coefficients of the MRT-LB model can be automatically given by a simple computer code. Finally, we perform numerical simulations of several benchmark problems, and find that the numerical results can achieve a fourth-order convergence rate, which is in agreement with our theoretical analysis. In particular, for the isotropic diffusion equation, we also make a comparison between the fourth-order MRT-LB models with the DdQ(2d^2+1) and DdQ(2d+1) lattice structures, and the numerical results show that the MRT-LB model with the DdQ(2d^2+1) lattice structure is more general.

Explore related subjects

math.NAcs.NAmath-phmath.MP

Keep this discovery

BibTeXRIS

Ying Chen, Zhenhua Chai, Baochang Shi. 2025-03-10. An automatic approach to develop the fourth-order and L^2-stable lattice Boltzmann model for diagonal-anisotropic diffusion equations. https://arxiv.org/abs/2503.06817

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Stress-divergence, Laplacian, and rotational forms of the incompressible Navier--Stokes equations with variable viscosity

In the Navier--Stokes equations, incompressibility allows rewriting the viscous term in various forms leading to distinct numerical properties and flow descriptions. Furthermore, models accounting for non-Newtonian, thermal or turbulent effects often break the constant-viscosity assumption, thereby producing additional consistency terms. In this context, the present work compares the classical symmetric-gradient diffusion term with more recent variable-viscosity generalizations of the Laplacian and rotational forms. We discuss, analyze and test their differences with respect to implementation, efficiency, numerical stability and outflow boundary conditions. With a focus on time-dependent flows, we consider second-order implicit-explicit (IMEX) temporal discretizations aimed at improving efficiency and numerical stability. Through a rigorous stability analysis, we show how selected explicit treatments can bypass algorithmic nonlinearities without inducing CFL conditions. Our numerical results highlight important differences between the three viscous formulations---especially in the presence of outflow boundaries, for which the generalized Laplacian form proves more suitable in diffusion-dominated regimes. %(as widely known for constant viscosity).

math.NA↗
arXiv2026

Full-window branch discovery and loss-selected EnKF continuation for data assimilation

We develop a framework for offline full-window branch discovery, optionally followed by online continuation with an ensemble Kalman filter (EnKF). Three mechanisms drive the branch search: adjoint path-kernel (APK) differentiation balances kernel differentiation and correction-stabilized path perturbation, shifting the optimization from exploration to exploitation; an optimized Gaussian initial law broadens the search over initial-state basins; and loss-weighted mixing across independent runs recombines successful path components. We may then select an interior state using a local loss and continue online with an EnKF. In 40-dimensional Lorenz-96 experiments, the mean offline path RMSE of APK is 4.3 times smaller than that of population weak-$\mathrm{4D\text{-}Var}_x$. The resulting APK-EnKF method has a mean online RMSE 64 times smaller than that of ordinary EnKF.

math.NA↗
arXiv2026

A variational physics-informed graph neural network for heterogeneous solid mechanics

Stress localization in heterogeneous solids is governed by the bimaterial interface, where the displacement field remains $C^0$-continuous, while in-plane stresses jump due to the stiffness mismatch. Coordinate-based physics-informed neural networks (PINNs) represent this jump via a prescribed regularization width or a weighted interface penalty, making their accuracy sensitive to how phase-contrast changes are handled. This work presents a variational, label-free physics-informed graph neural network (PI-GNN) in which the heterogeneity is carried by the discretization rather than by the trial field. The solver operates on a conforming adaptive mesh graph, assigns constitutive behavior per element, and minimizes the discrete total potential energy as a single unweighted objective in which only first derivatives appear. The discrete energy on piecewise-linear elements coincides with the finite element (FE) Ritz functional. Dirichlet conditions are enforced by construction, with no penalty term, no interface weight, and no prescribed transition width. Using one fixed architecture, optimizer, and loss across small-strain elasticity and finite-strain Neo-Hookean hyperelasticity in two and three dimensions, the von Mises error remains below $3.58\%$ across a stiffness-contrast sweep spanning $(E_{\mathrm{inc}}/E_{\mathrm{mat}}\in[10^{-2},10^{2}])$, where a strong-form PINN degrades to $5.58\%$, and its displacement error reaches $7.66\%$ against $0.49\%$ for the PI-GNN. A trained network halves the ($\sigma_{xx}$) error of an energy-based PINN ($5.01\%$ versus $10.94\%$). Training cost exceeds a single FE solve by more than an order of magnitude, so the construction is a variationally consistent, penalty-free interface representation for parametric surrogates and inverse identification rather than a replacement for a one-off FE analysis.

math.NA↗