OpenAlex ·

Mesh-Uniform Power Stability of Two-Relaxation-Time Vector Lattice Boltzmann Schemes with Reversible Boundaries

Jin Zhao

Published
Source
OpenAlex
DOI
10.48550/arxiv.2608.30253
Original
Read it at the publisher
Topics
Numerical AnalysisComputational Physics

Abstract

We consider the collision-transport operator for vector-valued two-relaxation-time lattice Boltzmann schemes linearized about a uniform rest state. Assume that the equilibrium blocks are positive definite and that the link-even and link-odd relaxation parameters satisfy s_+ + s_- = 2 and 0 < s_- < 2. If the homogeneous transport is unitary in the equilibrium metric and reversible under velocity exchange, then the powers of the amplification operator are bounded uniformly with respect to the number and arrangement of lattice nodes. The admissible transports include periodic transport, vector halfway bounce-back, coordinate-aligned specular reflection, tangential orthogonal involutions, and compatible multi-channel scattering. The proof reduces the population equation to a two-step macroscopic recurrence generated by a contraction. An inclusion of the numerical range in an ellipse, combined with the Crouzeix-Palencia theorem, yields a dimension-independent estimate for the companion operator and hence the population bound. For a three-coefficient off-midpoint boundary interpolation, we give an exact rational D2N5 example whose finite-domain amplification matrix has a real eigenvalue larger than one, although the interpolation coefficients and bulk parameters are admissible. Thus coefficient convexity alone does not ensure stability for this boundary family.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Numerical Analysis

Get the few papers worth your time in Numerical Analysis every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics