Highly accurate simplified lattice Boltzmann method

In this paper, we present a highly accurate simplified lattice Boltzmann method (HSLBM) which can achieve the third-order of accuracy in space. By introducing virtual streaming nodes and decoupling the streaming distance from the mesh spacing, HSLBM effectively combines the local second-order simpli...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Physics of fluids (1994) 2018-10, Vol.30 (10)
Hauptverfasser: Chen, Z., Shu, C., Tan, D.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this paper, we present a highly accurate simplified lattice Boltzmann method (HSLBM) which can achieve the third-order of accuracy in space. By introducing virtual streaming nodes and decoupling the streaming distance from the mesh spacing, HSLBM effectively combines the local second-order simplified and highly stable lattice Boltzmann method (SHSLBM) and the overall high order scheme. The correlation between the streaming distance and the mesh spacing is accomplished by a high-order Lagrange interpolation algorithm. Through a series of tests, it is found that using 5 interpolation points and setting streaming distance as 1/5 of the mesh spacing can give optimal results. In general, HSLBM improves the accuracy of SHSLBM from the second order to the third order, while maintaining its merits like low memory cost, convenient implementation of physical boundary conditions, and good numerical stability. To match the accuracy of the flow solver, a linear extrapolation scheme with the third-order of accuracy is also proposed to determine the boundary values of the non-equilibrium distribution functions. Various benchmark tests are performed to demonstrate the robustness of HSLBM in simulating two- and three-dimensional incompressible viscous flows as well as its flexibility in problems with curved boundaries and on body-fitted meshes.
ISSN:1070-6631
1089-7666
DOI:10.1063/1.5050185