Abstract
The lattice Boltzmann method (LBM) is a numerical scheme for solving fluid dynamics problems. One of the important and actively developing areas of LBM is correct construction of the scheme on nonuniform spatial grids. With nonuniform grids the total number of calculations can be significantly reduced. However, at the moment the construction of an LBM scheme near a boundary of grids with different spatial steps inevitably requires data interpolation, which may reduce the LBM approximation order and lead to violation of conservation laws. In this work, for the first time, we have developed and tested a method for constructing an athermal node-based LBM on nonuniform grids without interpolation, with the same time step for grids of different scales. The method is based on a two-stage transformation of populations corresponding to different on-grid stencils.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1. INTRODUCTION
The lattice Boltzmann method (LBM) [1–3] is a numerical scheme for solving fluid dynamics problems. It is based on quadrature formulas for calculating the velocity moments of a kinetic distribution function: density, flow velocity, and temperature. The moments are expressed in terms of a set of populations—discrete values of the distribution function. The evolution of the populations is described by a system of discrete Boltzmann kinetic equations: each of these corresponds to a fixed velocity, \(\mathbf{c}_i\). The set of velocities \(\{ \mathbf{c}_i \}\) at which the populations move along a spatial grid is called an LBM stencil.
An important and fast developing area of LBM is the construction of this scheme on nonuniform spatial grids [4–9]. Grid refinement only in the required limited area can significantly decrease the total number of calculations, thereby increasing the efficiency of the method. The construction of an LBM scheme at the interface of grids with different spatial steps makes it necessary to interpolate the data in space and/or time [4–15]. This may decrease the approximation order of the LBM and cause a violation of the conservation laws.
The present paper describes, for the first time, a method for constructing an athermal node-based LBM without interpolation on nonuniform grids with the same time step for these different grids. In this method, the streaming of LBM populations at the boundary of the grids is performed by using three different LBM stencils such that all stencils are on the grid and no interpolation is needed. However, this causes the need for a transformation: a local transition from the set of populations corresponding to one of the stencils to the set of populations of another stencil. This is due to the fact that the sets of populations corresponding to different stencils are solutions to different systems of discrete Boltzmann equations. We have developed a two-step method for a local transformation of the populations for arbitrary stencils, which includes scaling of the nonequilibrium parts of the populations [10] and moment matching developed for PonD [16, 17].
The method developed in the present paper has been tested by modeling a Poiseuille flow and a damping harmonic wave on a nonuniform spatial grid.
2. DESCRIPTION OF THE METHOD
2.1. Construction of the LBM. Free and Fixed Parameters
The Boltzmann kinetic equation has the form
where \(f \left(t, \boldsymbol{r}, \boldsymbol\xi\right)\) is a one-particle distribution function depending on time \(t\), a spatial coordinate \(\boldsymbol{r}\) and a velocity \(\boldsymbol\xi\), and \(\hat\Omega\) is a collision term.
The macroscopic flow parameters (density \(\rho(t, \boldsymbol{r})\), flow velocity \(\mathbf{u}(t, \boldsymbol{r})\), and temperature \(T(t, \boldsymbol{r})\)) are defined by the distribution function moments:
Here \(D\) is the dimension of the space under consideration.
If the collision term is absent, a solution to (1) satisfying the relations (2) is the equilibrium distribution function
Let us use numerical quadrature integration to calculate the moments (2). Taking into account the particular solution (3), consider the weight factor
Suppose that we have constructed a quadrature formula that is an approximation of order \(n\):
where \(\mathbf{c}_i = \xi_0 \boldsymbol{v}_i\), \(\boldsymbol{v}_i\) is a quadrature node, and \(w_i\) is the weight corresponding to this node.
The set of velocities \(\{ \mathbf{c}_i \}\) is an LBM stencil. Thus, a stencil is defined by the quadrature being used and the parameter \(\xi_0\).
where we have a discrete set of populations
Similarly, for the other moments
For the populations (7) of the equilibrium distribution function (3) we obtain
Assuming the flow velocity \(\mathbf{u}\) to be small, we can expand (9) and obtain the well-known representation of equilibrium populations:
which exactly satisfies the relations (6), (8) if we use a quadrature of at least the fourth order of approximation (in this case, we again have \({T = \xi_0^2}\)). Note that the expression (10) depends both on the choice of the quadrature points \(\boldsymbol{v}_i\) and on the choice of the parameter \(\xi_0\).
Let us discuss what \(\xi_0\) means. In the above, \(\xi_0\) is a free parameter, which, in particular, allows scaling the set of discrete velocities \(\mathbf{c}_i\), thereby acting as an additional variable when constructing stencils. Thus, \(\xi_0\) can be considered a parameter relating an abstract mathematical quadrature with a real space and time/LBM stencil. In addition, based on (3), \(\xi_0^2\) can be considered as a temperature or squared sound speed. However, here we are not interested in these quantities and consider an athermal LBM for which fifth-order quadratures are sufficient [1].
Thus, owing to the relations (6), (8), the macroscopic parameters of the system are expressed in terms of the discrete populations \(f_i\). Their evolution in time is determined by a set of Boltzmann kinetic equations discretized with respect to the velocity \(\boldsymbol\xi\). This can be obtained from (1) by setting \(\boldsymbol\xi = \mathbf{c}_i\) and multiplying, according to (7), by \(w_i / \omega(c_i)\):
Next, in the following discussion we will use the BGK collision operator [18]. In this case
where \(\tau\) is another free parameter, which is the characteristic time of relaxation of the distribution function to equilibrium.
To numerically solve equations (11), we introduce a uniform spatial grid with step size \(\Delta x\). We discretize (11) by dividing the evolution of populations corresponding to discrete time step \(\Delta t\) into two successive stages:
\(\bullet\) streaming stage:
\(\bullet\) collision stage:
To satisfy the last condition in (13), which allows the populations \(f_i\) to propagate strictly over the chosen spatial grid, the stencil \(\{ \mathbf{c}_i \}\) must be normalized according to the chosen steps \(\Delta x\) and \(\Delta t\). This can be done by an appropriate choice of the scaling parameter \(\xi_0\). For instance, for the D2Q9 stencil, which corresponds to a quadrature with points
we need to set \(\xi_0 =\tfrac{\Delta x}{\sqrt{3} \Delta t}\).
Taking into account the above, the LBM numerical scheme takes the following simple form: at the streaming stage the populations \(f_i\) propagate strictly over the discrete spatial grid with their velocities \(\mathbf{c}_i\), and at the collision stage they locally get increments according to (14).
Finally, let us define one of the most important characteristics of a macroscopic flow, namely, viscosity \(\nu\). Based on the Chapman–Enskog expansion, in terms of LBM [1] we have
Let us again list the main parameters used in the construction of a classical LBM and the relations these parameters must satisfy. Suppose we wish to simulate a flow with viscosity \(\nu\) on a uniform spatial grid with a given spatial step \(\Delta x\). In this case, the relations
where \(\xi_0\), \(\Delta t\), and \(\tau\) may be considered free parameters, must be satisfied.
We may also choose a quadrature, that is, its points \(\boldsymbol{v}_i\). However, first, the less nodes are in the quadrature, the easier it is to solve the scheme numerically. Second, to satisfy the first condition in (17) for any components of any quadrature points, these points must, up to a common scaling factor, be strictly on the chosen spatial grid. In addition, to simulate the Navier–Stokes equations with the viscosity (16), a quadrature of at least fifth-order approximation is required [1]. These conditions limit the choice of quadratures considerably (but not completely).
2.2. Nonuniform Grids
Let us construct an LBM scheme without interpolation at the interface between two-dimensional grids of different scales. Assume that we have a uniform “coarse” grid with \(\Delta x_c = 1\) on the left, and a uniform “fine” grid with \(\Delta x_f = 1/2\) on the right (Fig. 1).
First note that there are two equivalent paradigms for the streaming stage of the LBM: Push and Pull. In the case of paradigm Push, the new set of populations (after the streaming stage) at a grid node is determined by the stencils of other nodes. That is, we need to take those populations of the other nodes that propagate according to their stencils into that being considered. In the case of paradigm Pull, the new set of populations at a grid node is determined by the stencil of this node. That is, populations are “requested” from other nodes according to the stencil of the node being considered. If we have a uniform spatial grid, these paradigms are indistinguishable. However, this is not the case for nonuniform grids. In what follows, we will employ with paradigm Pull.
Now let us construct LBM schemes individually for coarse and fine uniform grids. We will use a two-dimensional Gauss–Hermite quadrature and, accordingly, the set of nodes (15). The first condition in (17) for both grids can be satisfied in different ways: similarly to spatial scaling, we can introduce time step scaling for the fine grid, that is, set \(\Delta t_c = 2 \Delta t_f = 1\) (\({\xi_{0, c} = \xi_{0, f} = 1 / \sqrt{3}}\)) (as, for example, in [10]). The problem with this approach is that data interpolation at the interface between the grids is inevitable, since this is the only way to obtain information at the interface for the fine grid at the half-integer time steps. We will use another method: stencil scaling by changing the parameter \(\xi_0\). Set
and define the stencils for points on the coarse and fine grids as
Thus, in the case of paradigm Pull for large round nodes in Fig. 1 we will use stencil \(\{ \mathbf{c}_{i, c} \}\), and for small round nodes \(\{ \mathbf{c}_{i, f} \}\). For square nodes, a new stencil is needed. It is easy to see from the location of these points at the interface that such a stencil cannot be constructed by scaling the quadrature (15). One of the simplest stencils for square nodes in Fig. 1, which is a fifth-order approximation, is constructed in Appendix A.
Now we have defined a stencil for each node of our nonuniform grid. Note that at the streaming stage near the interface between grids of different scales the nodes corresponding to one of the stencils being used will request populations from the nodes corresponding to another stencil. Thus, we see that a local transformation of the populations of one stencil into the populations of another stencil is necessary.
2.3. Transformation Method
Let us present a method for a local (in time and space) transformation of populations between two arbitrary stencils.
A discretized Boltzmann kinetic equation (13), (14) has the form
In terms of the LBM cycle, (20) can be understood as follows: according to the right-hand side of the equality, the populations going from point \((t, \boldsymbol{r})\) (after the collision stage!) are determined by populations at the same point.
To find a relation between the sets of populations outgoing from a node corresponding to different stencils, let us consider the Chapman–Enskog expansion [1, 19]. Taking into account only the linear correction with respect to the Knudsen number \(\epsilon\), we have
or in explicit form
Let us consider first an existing method of transformation between the sets of populations corresponding to similar stencils \(\{ \mathbf{c}_i \}\) but different parameters \(\Delta t\) and \(\tau\)in (20). Assume that we have a coarse grid with parameters \(\Delta t_c\) and \(\tau_c\). Substituting (22) into (20), we obtain
Similarly, for a grid with \(\Delta t_f = \Delta t_c / n\), \(\tau_f\) we have
Dividing (23) by (24), we obtain the formula [10]
in which a relation between \(\tau_c\) and \(\tau_f\) is given by the fact that the viscosity (17) is the same on the different grids:
Now we obtain an expression, which is similar to (25), for the case of interest to us: \(\Delta t_c = \Delta t_f = \Delta t\). Let us first consider two stencils corresponding to the same quadrature \(\{ \boldsymbol{v}_i \}\) but different parameters \(\xi_0\) to obtain the necessary grid scaling. Set
and
and instead of the relation (26) we have
With (27), (28), instead of (25) we have the following relation between the post-collision populations:
Let us find out how \(D f_i^\text{eq}\) depends on the grid. For this, let the derivatives in the operator \(D\) explicitly act on the moments \(\rho, \mathbf{u}\). From (10), (22) we find
Let us eliminate the time derivatives in (31) by using the equations for the first-order moments in \(\epsilon\):
where
Taking the derivative
and, using (32), (33), rewrite the expression (31) as follows:
Let us return to the standard derivatives in (35) (according to (21)), and express the velocities of the stencil in terms of the quadrature points (\(\mathbf{c}_i = \xi_0 \boldsymbol{v}_i\)) to obtain an explicit dependence on the parameter \(\xi_0\):
One can see from (36) that the underlined terms, which are linear in velocity, coincide for the stencils on different scales. This is not the case for the quadratic and cubic terms. If we neglect them, for the first-order terms in \(u\) the transformation formula (30) takes the form
Finally, let us discuss the general case of transformation between stencils corresponding to different quadratures \(\{ \boldsymbol{v}_i \}\) and different values of \(\xi_0\) (and, hence, based on (27), (29), to different values of \(\tau\)). The transformations (25) and (37) of populations corresponding to the same quadrature \(\{ \boldsymbol{v}_i \}\) are necessary, because these populations correspond to different values of \(\tau\). Therefore, they are used to solve Eq. (20) with different collision terms. Thus, these transformations “align” the parameter \(\tau\). In the case that is of interest to us (\(\Delta t_c = \Delta t_f = \Delta t\)), to change between the sets of populations corresponding to the same value of \(\xi_0\) (to the same value of \(\tau\)) but to different quadratures, we can use moment matching [16, 17, 20, 21]. In this case, a relation between the populations is obtained by equating moments of the distribution function, for example,
where the total number of equalities is determined by the approximation order of the quadratures being used. In our case, we demand that Eq. (38) hold up to
Note that, in addition to the equalities (38), we can write an explicit relation between the populations corresponding to the same velocity \(\mathbf{c}_i\). In our case, these are populations \(f_0\) corresponding to zero velocity. It follows from (7) that
The relations (38) and (40) are a system of linear equations with respect to the populations of the stencil which we wish to obtain. This system may be underdetermined, and the number of independent equations in it may be less than the number of the required populations. For instance, this is the case when we change from the populations of stencil D2Q9 to those of stencil D2Q15. In this case, Eqs. (38) are used for higher approximation order, but the initial moments are calculated using the equilibrium distribution function corresponding to the node.
Let us summarize the results of Subsection 2.2: In the general case, the transformation of populations from an LBM stencil to another one takes place in two steps:
(1) Transfer to the populations of a stencil having the value of \(\tau\) that is the same as that of the final stencil (since, according to (16), the parameter \(\xi_0\) also changes, this step can be called scale alignment).
(2) Transfer to the populations of a stencil with the same quadrature as that of the final stencil (form alignment).
These two steps can be performed in any order.
3. TESTS
Let us perform a series of tests using our LBM scheme for nonuniform grids. We set
As the simulation domain, we take a rectangular grid refined along both axes at the lateral boundaries with a spatial grid refinement ratio of 2 (Fig. 2). The domain sizes, taking into account the half-cells at the lateral boundaries, are as follows:
We will compare the results of numerical calculations using the LBM with an analytical solution of the Navier–Stokes equations for an incompressible fluid (\(\boldsymbol{\nabla}\) is the nabla operator):
with the corresponding initial and boundary conditions.
3.1. The Algorithm
Let us describe the algorithm of the LBM numerical scheme used in the tests. Taking into account the transformation method described in the previous section, the algorithm in large part corresponds to the classical LBM in paradigm Pull: at each time step, each node requests populations according to its stencil. If a request is sent to a node that corresponds to another stencil, the local transformation process (in one or two steps) takes place before the streaming stage. The transformation of populations at the domain boundary is determined by the boundary conditions of the tests.
The following four stencils are used in the simulations: \(\{\mathbf{c}_{i, c}\}\), \(\{\mathbf{c}_{i, f}\}\) (19) for the large round nodes of the coarse grid and the small round nodes of the fine grid, respectively, stencil \(\{\mathbf{c}_{i, b}\}\) with a parameter \(\xi_{0, b} = 5\big / \sqrt{38}\) (Appendix A) for the square nodes at the boundaries of the coarse and fine grids, as well as a phantom stencil
not associated with any node, but necessary as an intermediate one in the transformation process.
In the simulation we use Aiwlib library [22].
Algorithm:
-
Streaming stage for the large round nodes. For the nodes at the boundaries of nonuniform grids, when requesting three populations from small round nodes, the transformation \(\{ \mathbf{c}_{i, f} \} \rightarrow \{ \mathbf{c}_{i, c} \}\) is performed by formula (37).
-
Streaming stage for the small round nodes. For the nodes at the boundaries of nonuniform grids, when requesting populations from large round nodes, the transformation \(\{ \mathbf{c}_{i, c} \} \rightarrow \{ \mathbf{c}_{i, f} \}\) is performed by formula (37), and when requesting populations from square nodes, the two-step transformation \(\{ \mathbf{c}_{i, b} \} \rightarrow \{ \mathbf{c}_{i, p} \} \rightarrow \{ \mathbf{c}_{i, f} \}\) (first (38), (40) for convert to \(\{ \mathbf{c}_{i, p} \}\), and then (37) for convert to \(\{ \mathbf{c}_{i, f} \}\)).
-
Streaming stage for the square nodes. When requesting populations from large round nodes, the two-step transformation \(\{ \mathbf{c}_{i, c} \} \rightarrow \{ \mathbf{c}_{i, p} \} \rightarrow \{ \mathbf{c}_{i, b} \}\) (first (37) for convert to \(\{ \mathbf{c}_{i, p} \}\), and then (38), (40) for convert to \(\{ \mathbf{c}_{i, b} \}\)). When requesting populations from small round nodes, the two-step transformation \(\{ \mathbf{c}_{i, f} \} \rightarrow \{ \mathbf{c}_{i, p} \} \rightarrow \{ \mathbf{c}_{i, b} \}\) (first (37) for convert to \(\{ \mathbf{c}_{i, p} \}\), and then (38), (40) for convert to \(\{ \mathbf{c}_{i, b} \}\)).
-
Local collision stage for all nodes with BGK parameters \(\tau = \Delta t / 2 + \nu / \xi_0^2\) (for the large round nodes \(\xi_{0, c} = 1\big/\sqrt{3}\), for the small round nodes \(\xi_{0, f} = 1\big/(2\sqrt{3})\), for the square nodes \(\xi_{0, b} = 5\big/\sqrt{38}\)).
3.2. Poiseuille Flow
Consider a steady Poiseuille flow \(\mathbf{u} = \mathbf{u}(x, y)\) which corresponds to the following conditions:
The solution of (43) takes the form
To simulate the Poiseuille flow with the LBM, we use “bounce-back” boundary conditions at the \(x\) axis [1] and zero initial conditions. To take into account the pressure gradient \(g\) at the collision stage, we add a correction \(\Delta u_y = g \tau / \rho\) to the velocity in equilibrium populations [23]. With time, the system will come to a steady state. The simulation results are shown in Fig. 3.
Let us compare the results of simulation with our code with the results of [5], which also considers two methods for constructing an LBM on nonuniform grids (namely, IVP and BVP) and provides simulation results for the Poiseuille flow. For this we constructed curves (see Fig. 4), which are similar to those in [5, Fig. 7]. Note, however, that to decrease the error caused by the simulation domain boundaries, [5] uses a TRT-operator of collision. For the same purpose, we choose a value of the parameter \(\tau =\big (\sqrt{3} + 2\big)\big/4\) at which this error does not exceed the error of the classical LBM [1]. To simulate the same velocity field, we keep the ratio \(g / \nu\) as in [5]. For the same \(N\), the resolution of the uniform grid is the same as that of the “fine” part of the nonuniform grid.
Figure 4 shows that our scheme converges stably to the exact solution in both norms. However, whereas the classical LBM on the uniform grid is a second-order approximation in both norms, our scheme is a first-order one both in the \(L_\infty\) and \(L_1\) norms. Our new method is comparable to the IVP method from [5], since it has similar convergence in the \(L_{\infty}\) norm.
3.3. Two-Dimensional Damping Harmonic Wave
Now consider a damping harmonic wave given by the conditions
and parameters \(\mathbf{u}_0\) and \(\mathbf{k}\) that satisfy the relations
The function
is a solution to (43), (47), (48).
Figure 5 shows the results of simulation of the damping harmonic wave by using the LBM scheme on nonuniform grids.
4. CONCLUSIONS
A scheme of constructing an athermal node-based LBM without interpolation on two-dimensional nonuniform grids, with the same time step for the grids of different scales, has been developed. The scheme employs different stencils for different types of nodes on a nonuniform grid, in particular, a stencil D2Q9 scaled by varying the free parameter \(\xi_0\). Data interpolation at the grid interface can be avoided by using a new population transformation method that makes it possible to change from the set of populations of one stencil to the set of populations of another one. The standard methods with interpolation are often first-order approximations (see [10, 12, 14, and 24]), less often second-order ones [5, 7, 25]. It has been shown that at the moment our scheme is a first-order approximation. Nevertheless, it can be increased by using different transformations of other stencils for velocities, etc. Our approach is a novel method for constructing relations between nonuniform grids, which has not been tested by other authors and can be further developed. This method can be used to construct new, similar, and more complex schemes and improve the existing ones.
APPENDIX
A. Stencil for Separate Boundary Nodes
Let us construct a stencil for the square interface nodes shown in Fig. 1. For a two-dimensional (\(D = 2\)) stencil to be a fifth-order approximation (\(n = 5\)), according to (4), (5) its points \(\{ \mathbf{c}_i \}\) and their weights \(\{ w_i \}\) must satisfy the following relations:
In the general case, their number is \((n+1)(n+2)/2 = 21\).
At fixed points of the stencil \(\{ \mathbf{c}_i \}\), (50) is a system of linear algebraic equations for the coefficients \(0 < w_i < 1\) with a parameter \(\xi_0\). If this system is solvable, the stencil can be constructed.
To simplify the system (50), assume that the stencil is symmetric about both axes, \(x\) and \(y\). All equations containing odd values of \(p\) or \(q\) will be satisfied automatically, and the number of nontrivial equations will be reduced to six. Thus, we need five coefficients \(w_i\) (taking into account the stencil symmetries) in addition to the free parameter \(\xi_0\).
Consider the stencil
shown in Fig. 6. The nontrivial equations to be satisfied are
The system (52)–(57) has a solution with
at a parameter \(\xi_{0, b} = 5 \big / \sqrt{38}\). Hence, the required stencil has been constructed.
FUNDING
This work was supported by the Russian Science Foundation (project no. 18-71-10004).
REFERENCES
Krüger, T., Kusumaatmaja H., Kuzmin A., et al., The Lattice Boltzmann Method: Principles and Practice, Springer, 2016; DOI: 10.1007/978-3-319-44649-3
Kuperschtokh, A.L., Simulation of Flows with Vapor-Liquid Interfaces Using Lattice Boltzmann Equation Method, Vest. NGU Ser. Mat., Mekh., Informat., 2005, vol. 5, no. 3, pp. 29–42.
Kupershtokh, A.L., Three-Dimensional Simulations of Two-Phase Liquid-Vapor Systems on GPU Using the Lattice Boltzmann Method, Numer. Meth. Progr., 2012, vol. 13, no. 1, pp. 130–138.
Yu Chen, Qinjun Kang, Qingdong Cai, and Dongxiao Zhang, Lattice Boltzmann method on quadtree grids, Phys. Rev. E, 2011, vol. 83, no. 2, Article no. 026707; DOI:10.1103/PhysRevE.83.026707
Guzik, S., Xinfeng Gao, Weisgraber, T., Alder, B., and Colella, P., An Adaptive Mesh Refinement Strategy with Conservative Space-Time Coupling for the Lattice-Boltzmann Method, Proc. 51st AIAA Aerospace Sciences Meeting Including the New Horizons Forum and Aerospace Exposition, American Institute of Aeronautics and Astronautics, 2013; DOI:10.2514/6.2013-866
Touil, H., Ricot, D., and Lévêque, E., Direct and Large-Eddy Simulation of Turbulent Flows on Composite Multi-Resolution Grids by the Lattice Boltzmann Method, J. Comput. Phys., 2014, vol. 256, pp. 220–233; https://doi.org/10.1016/j.jcp.2013.07.037.
Dorschner, B., Frapolli, N., Chikatamarla, S.S., and Karlin, I.V., Grid Refinement for Entropic Lattice Boltzmann Models, Phys. Rev. E, 2016, vol. 94, article no. 053311; DOI:10.1103/PhysRevE.94.053311
Fakhari, A., Geier, M., and Lee Taehun, A Mass-Conserving Lattice Boltzmann Method with Dynamic Grid Refinement for Immiscible Two-Phase Flows, J. Comput. Phys., 2016, vol. 315, pp. 434–457; DOI:10.1016/j.jcp.2016.03.058
Rohde, M., Kandhai, D., Derksen, J.J., and Van den Akker, H., A Generic, Mass Conservative Local Grid Refinement Technique for Lattice-Boltzmann Schemes, Int. J. Numer. Meth. Fluids, 2006, vol. 51, no. 4, pp. 439–468; DOI:10.1002/fld.1140
Filippova, O. and Hänel, D., Grid Refinement for Lattice-BGK Models, J. Comput. Phys., 1998, vol. 147, iss. 1, pp. 219–228.
Filippova, O. and Hänel, D., A Novel Lattice BGK Approach for Low Mach Number Combustion, J. Comput. Phys., 2000, vol. 158, iss. 2, pp. 139–160.
Chen, H., Filippova, O., Hoch, J., et al., Grid Refinement in Lattice Boltzmann Methods Based on Volumetric Formulation, Phys. A: Stat Mech. Its Appl., 2006, vol. 362, no. 1, pp. 158–167; DOI:10.1016/ j.physa.2005.09.036
Ye Zhao, Feng Qiu, Zhe Fan, and Kaufman, A., Flow Simulation with Locally-Refined LBM, Proc. of the 2007 Symposium on Interactive 3D Graphics and Games, 2007, pp. 181–188; https://doi.org/ 10.1145/1230100.1230132.
Dupuis, A. and Chopard, B., Theory and Applications of an Alternative Lattice Boltzmann Grid Refinement Algorithm, Phys. Rev. E, 2003, vol. 67, article no. 066707; DOI:10.1103/PhysRevE.67.066707
Geier, M., Greiner, A., and Korvink, J.G., Bubble Functions for the Lattice Boltzmann Method and Their Application to Grid Refinement, Europ. Phys. J. Spec. Topics, 2009, vol. 171, no. 1, pp. 173–179; DOI:10.1140/epjst/e2009-01026-6
Dorschner, B., Bösch, F., and Karlin, I.V., Particles on Demand for Kinetic Theory, Phys. Rev. Let., 2018, vol. 121, article no. 130602; DOI:10.1103/PhysRevLett.121.130602
Zipunova, E., Perepelkina, A., Zakirov, A., and Khilkov, S., Regularization and the Particles-on-Demand Method for the Solution of the Discrete Boltzmann Equation, J. Comput. Sci., 2021, vol. 53, no. 4, article no. 101376; DOI:10.1016/j.jocs.2021.101376
Bhatnagar, P.L., Gross, E.P., and Krook, M., A Model for Collision Processes in Gases. I. Small Amplitude Processes in Charged and Neutral One-Component Systems, Phys. Rev., 1954, vol. 94, no. 3, pp. 511–525; DOI:10.1103/PHYSREV.94.511
Kuperschtokh, A.L., Account of the Action of Body Forces in the Lattice Boltzmann Equations, Vest. NGU. Ser. Mat., Mekh., Informat., 2004, vol. 4, pp. 75–96.
Zakirov, A.V., Korneev, B.A., Levchenko, V.D., and Perepelkina, A.Yu., On the Conservativity of the Particles-on-Demand Method for Solution of the Discrete Boltzmann Equation, Preprint of Keldysh Institute of Applied Mathematics, Russ. Acad. Sci., 2019, no. 35.
Zipunova, E.V. and Perepelkina, A.Yu., Development of Explicit and Conservative Schemes for Lattice Boltzmann Equations with Adaptive Streaming, Preprint of Keldysh Institute of Applied Mathematics, Russ. Acad. Sci., 2022, no. 7.
Ivanov, A. and Khilkov, S., Aiwlib Library as the Instrument for Creating Numerical Modeling Applications, Sci. Visual., 2018, vol. 10, no. 1, pp. 110–127.
Sukop, M.C. and Thorne, D.T., Lattice Boltzmann Modeling: An Introduction for Geoscientists and Engineers, Springer, 2006.
Lin, C.L. and Lai, Y.G., Lattice Boltzmann Method on Composite Grids, Phys. Rev. E, 2000, vol. 62, no. 2, pp. 2219–2225; DOI:10.1103/PhysRevE.62.2219
Tolke, J. and Krafczyk, M., Second Order Interpolation of the Flow Field in the Lattice Boltzmann Method, Comput. Math. Appl., 2009, vol. 58, iss. 5, pp. 898–902.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Translated from Sibirskii Zhurnal Vychislitel’noi Matematiki, 2023, Vol. 26, No. 3, pp. 235-252. https://doi.org/10.15372/SJNM20230301.
Rights and permissions
About this article
Cite this article
Berezin, A.V., Ivanov, A.V. & Perepelkina, A.Y. LBM without Interpolation on Non-Uniform Grids. Numer. Analys. Appl. 16, 193–207 (2023). https://doi.org/10.1134/S1995423923030011
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1995423923030011