Lattice Boltzmann Equation on a Two-Dimensional Rectangular Grid
✍ Scribed by M'hamed Bouzidi; Dominique d'Humières; Pierre Lallemand; Li-Shi Luo
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 131 KB
- Volume
- 172
- Category
- Article
- ISSN
- 0021-9991
No coin nor oath required. For personal study only.
✦ Synopsis
We construct a multirelaxation lattice Boltzmann model on a two-dimensional rectangular grid. The model is partly inspired by a previous work of Koelman to construct a lattice BGK model on a two-dimensional rectangular grid. The linearized dispersion equation is analyzed to obtain the constraints on the isotropy of the transport coefficients and Galilean invariance for various wave propagations in the model. The linear stability of the model is also studied. The model is numerically tested for three cases: (a) a vortex moving with a constant velocity on a mesh with periodic boundary conditions; (b) Poiseuille flow with an arbitrary inclined angle with respect to the lattice orientation; and (c) a cylinder asymmetrically placed in a channel. The numerical results of these tests are compared with either analytic solutions or the results obtained by other methods. Satisfactory results are obtained for the numerical simulations.
📜 SIMILAR VOLUMES
The accuracy of colocated finite volume schemes for the incompressible Navier -Stokes equations on non-smooth curvilinear grids is investigated. A frequently used scheme is found to be quite inaccurate on non-smooth grids. In an attempt to improve the accuracy on such grids, three other schemes are
Mesoscopic conductance fluctuations of a two-dimensional electron gas in a one-dimensional periodic array of antidots have been studied experimentally, for the first time. The fluctuations show a quasiperiodic behaviour on magnetic field, with period corresponding to the quantization of magnetic flu
In this paper, we present several new and generalized parallel dense matrix multiplication algorithms of the form C = αAB + βC on two-dimensional process grid topologies. These algorithms can deal with rectangular matrices distributed on rectangular grids. We classify these algorithms coherently int