Table of Contents
3.1 Boundary and Initial Conditions in LBM in a Nutshell
LB Initialization
•
Steady-state solutions: Set initial populations to equilibrium.
◦
.
◦
Typical choice: (simulation units), .
•
Time-dependent solutions: Require both equilibrium and non-equilibrium components.
◦
.
Main LB Algorithm Steps
1.
Compute fluid density and velocity via moment equations.
2.
Compute equilibrium populations from Maxwell-Boltzmann distribution.
3.
Output macroscopic fields if desired.
4.
Apply collision to find post-collision populations .
5.
Propagate populations following streaming step.
6.
Propagate populations at boundaries according to local boundary conditions.
7.
If wet-node boundary conditions used, compute their populations as neccessary.
8.
Increment time step and repeat.
3.1.1 Boundary Conditions
•
Boundary conditions apply at boundary nodes - sites with at least one link to both solid and fluid nodes.
•
LB boundary conditions prescribe mesoscopic populations rather than macroscopic variables.
•
Two main families of boundary schemes:
◦
Link-wise: Boundary located on lattice links (e.g., bounce-back).
◦
Wet-node: Boundary located on lattice nodes.
•
Key characteristics comparison:
3.1.2 Initial Conditions
•
Two approaches for consistent initial conditions:
◦
Explicit Chapman-Enskog decomposition into equilibrium and non-equilibrium parts.
◦
Modified LB scheme run before actual simulation.
3.2 Fundamentals
3.2.1 Concepts in Continuum Fluid Dynamics
•
Time-dependent problems require initial conditions: .
•
General form of boundary conditions:
◦
: the solution of a generic PDE.
◦
: the boundary location.
◦
: the (outward) boundary normal.
•
Boundary conditions classify into three types:
◦
Dirichlet: Fixed value of solution at boundary ( & ).
◦
Neumann: Fixed flux at boundary ( & ).
◦
Robin: Relation between value and flux at boundary ( & ).
•
For hydrodynamics:
◦
Dirichlet condition for the fluid velocity:
▪
: the boundary velocity.
◦
Neumann condition for the fluid velocity:
▪
: the sum of pressure and viscous contributions (total stress tensor) as defined in .
▪
: the traction vector prescribed at boundary.
3.2.2 Initial Conditions in Discrete Numerical Methods
•
Initial condition still specified by .
⇒ But a more general step called initialization is also necessary.
3.2.3 Boundary Conditions in Discrete Numerical Methods
•
The order of accuracy of discretized boundary conditions should never be inferior to that of the bulk solution.
⇒ The accuracy of the solution may degrade everywhere; single point with lower accuracy can degrade solution everywhere.
3.2.4 Boundary Conditions for LBM: Introductory Concepts
Which Lattice Sites Need Boundary Conditions?
•
Fluid nodes refer to sites where the LBE applies.
•
Solid nodes are sites completely covered by the solid object where LBE doesn't apply.
•
Boundary nodes link fluid and solid nodes; they require special dynamical rules.
•
Problem: Unknown incoming populations from solid must be specified.
◦
The role of LB boundary conditions is to specify appropriate values for the incoming populations, meaning those moving from the solid object into the fluid region.
Key Differences from Traditional Methods
•
LBM must prescribe mesoscopic populations rather than macroscopic variables (e.g. velocity or pressure).
•
The fundamental difficulty is that the system of mesoscopic variables has more degrees of freedom than the corresponding macroscopic system.
⇒ Non-uniqueness problem leads to variety of boundary schemes.
How Can Boundary Conditions Be Formulated?
•
Despite the large number of methods available, all LB oundary conditions for straight boundaries belong to one of two groups:
◦
Link-wise family: boundary on lattice links.
◦
Wet-node family: boundary on lattice nodes.
What Defermines the Numerical Accuracy of LB Boundary Conditions?
•
Exactness: Ability to exactly resolve flows of certain order.
•
Accuracy: How error scales with resolution.
•
Chapman-Enskog expansion:
•
For LB boundaries:
◦
Second-order accurate: .
◦
Third-order accurate: .
3.3 Boundary Condition Methods
3.3.1 Periodic Boundary Conditions
•
Periodic boundary conditions apply only to situations where the flow solution is periodic.
◦
They state that the fluid leaving domain on one side will, instantaneously, re-enters at the opposite side.
◦
They conserve mass and momentum at all times.
•
For NSEs, periodic flow conditions along a single dimension are applied as:
◦
: the periodicity direction and length of the flow pattern.
•
For LBM implementation:
◦
For the 2D flow problem:
3.3.2 Periodic Boundary Conditions with Pressure Variations
•
For incompressible flows, the generalized periodic boundary conditions:
•
A simple and robust procedure proposed by Kim and Pitsch (2D flow problem):
1.
Decompose the populations on the virtual nodes (, ) into equilibrium and non-equilibrium parts.
2.
Equilibrium part:
•
: the velocity at nodes
•
: the velocity at nodes
•
The subscripts “in” and “out” denote the pressure values at the left and right physical boundaries, respectively.
•
: the intended pressure drop along the periodicity length .
3.
Non-equilibrium part:
•
Non-equilibrium populations are determined after collision, i.e.
4.
Finally, we merge the equilibrium part and the non-equilibrium part and perform the streaming step:
3.3.3 Solid Boundaries: Bounce-Back Approach
Principle of the Bounce-Back Method
•
Populations hitting rigid wall during propagation are reflected back to where they originally came from.
•
The bounce-back of particles hitting a wall implies no flux across the boundary. → The wall is impermeable to the fluid.
•
The fact that particles are bounced back implies no relative transverse motion between fluid and boundary. → The fluid does not slip on the wall (no-slip boundary).
Implementation Types of Bounce-Back Method
•
Fullway bounce-back (a):
◦
Particles travel complete link path from the boundary to the solid node.
⇒ The particle velocity is inverted in the next collision step.
◦
Requires solid nodes for storage.
◦
delay for time-dependent problems.
•
Halfway bounce-back (b):
◦
Particles travel only half of the link distance.
⇒ The particle velocity is inverted during the streaming step.
◦
More accurate for unsteady flows.
•
Both the fullway and halfway approaches assume that the boundary is located approximately midway between solid and boundary nodes, not on the solid nodes themselves.
Resting Walls
•
Physical Mechanism:
◦
Populations leaving the boundary node at time meet the wall surface at .
◦
Populations are reflected back with a reversed velocity: .
◦
Reflected populations return to the boundary node at .
•
Boundary Condition:
◦
: opposite direction to .
•
Implementation Example (Bottom Wall):
•
Key Features:
◦
Simple specular reflection.
◦
No momentum transfer from wall.
◦
Maintains no-slip condition ( at wall).
Moving Walls
•
Physical Mechanism:
◦
Moving wall imparts momentum to bouncing particles.
◦
Momentum exchange must satisfy Galilean invariance.
◦
Understood via reference frame transformation approach: (i) transform to the rest frame of the wall, (ii) perform bounce-back there, and (iii) transform back to the initial frame.
•
Boundary Condition (modified bounce-back with momentum correction):
◦
: prescribed wall velocity.
◦
: fluid density at wall location .
◦
Correction term vanishes when (reduces to resting wall).
•
Key Challenges:
◦
Density estimation: unknown at the wall (for the general compressible flow). → Approximated by or .
◦
Mass conservation: exact conservation difficult for inclined boundaries.
◦
Accuracy trade-off: mass-conserving strategies may reduce solution accuracy.
Advantages
•
Simple implementation.
•
Stable even near .
•
Exact mass conservation at resting boundaries.
•
It can be implemented straightforwardly for any number of spatial dimensions.
Disadvantages
•
The bounce-back rule can only approximates arbitrary surfaces through "staircase" shapes.
•
The exact location of the no-slip boundary is viscosity-dependent when the bounce-back scheme is used together with the BGK collision model.
⇒ This defect may be solved by replacing the BGK model by a more complex collision model such as TRT or MRT.
Numerical Evaluation of the Accuracy of the Bounce-Back Method
•
Couette flow: first-order analysis.
◦
For Couette flow we observed that:
(i) bounce-back places the no-slip wall exactly midway between boundary and solid nodes,
(ii) solutions are viscosity-independent.
⇒ Bounce-back, with the wall shifted by from boundary nodes, correctly prescribes the boundary value of the velocity and its first-order derivative.
MATLAB Code of Couette flow
•
Poiseuille flow: second-order analysis.
◦
Unlike the numerical Couette flow solution, the Poiseuille flow simulation is affected by the choice of . → Numerical Boundary Slip
◦
For Poiseuille flow we observed that:
the bounce-back rule performs better with the walls located midway between boundary and solid nodes, just as for Couette flow.
⇒ However, the parabolic solution is generally not exact, due to an error depending on and therefore on viscosity.
⇒ The slip error comes from the term in the bounce-back closure relation.
◦
To avoid the unphysical viscosity-dependent slip, the safest procedure is to replace BGK by the TRT or MRT collision operators.
MATLAB Code of Poiseuille flow
3.3.4 Solid Boundaries: Wet-Node Approach
Finding the Density on Boundaries
•
Use continuity condition as constraint.
◦
For top wall:
◦
For bottom wall:
Equilibrium Scheme
•
Simplest approach:
◦
Replaces all populations at boundary, instead of only the unknown ones.
•
Advantages:
◦
(i) Excellent stability, (ii) Easy to apply in 2D/3D.
•
Disadvantages:
◦
(i) Only accurate when , (ii) First-order accuracy otherwise.
•
The linear incompressible equilibrium populations on boundary nodes:
◦
For top wall:
◦
For bottom wall:
Non-Equilibrium Extrapolation Method
•
Includes non-equilibrium part from neighboring fluid node:
◦
Replaces all populations at boundary, instead of only the unknown ones.
◦
Second-order accurate. → Cannot capture parabolic solutions exactly
•
Non-equilibrium approximation:
◦
where
•
Couette flow: NEEM provides exact solution regardless of value.
•
Poiseuille flow: Method introduces errors by implicitly enforcing , which cannot be satisfied in parabolic solutions.
Non-Equilibrium Bounce-Back Method (Zou-He Method)
•
The non-equilibrium bounce-back (NEBB) method enforces bounce-back for the non-equilibrium part:
◦
There will be no way to guarantee that the tangential velocity obtains the intended value.
⇒ We used two macroscopic conditions: (i) density (or pressure) and (ii) normal velocity.
◦
The NEBB is modified with transverse momentum correction :
▪
: a tangent unit vector along the wall.
◦
Third-order accurate, viscosity-independent → Exact for parabolic solutions.
◦
The NEBB method modifies only the missing populations.
3.3.5 Open Boundaries
Open boundaries consist of inlets or outlets where the flow either enters or leaves the computational domain and where we should impose, for example, velocity or density profiles.
This is often non-trivial, and it can cause both physical and numerical difficulties.
Velocity Boundary Conditions
•
Bounce-back approach:
◦
Same as the moving wall bounce-back with prescribed .
⇒ The bounce-back algorithm still places the inlet/outlet boundary, with its imposed velocity , midway between the lattice nodes.
•
Wet-node approach:
◦
The wet-node formulation of velocity boundary conditions applies similarly to open boundaries and walls.
⇒ The only difference is that the velocity represents the mass flux entering or leaving the domain, rather than the movement of a solid wall.
Pressure Boundary Conditions
•
Anti-bounce-back approach:
◦
The boundary is located outside the boundary node.
◦
It requires specification of which is not generally known. → A possible way to estimate is by extrapolation.
◦
Formally third-order accurate.
•
Wet-node approach:
◦
In the wet-node approach, the algorithm for imposing pressure and velocity boundary conditions is the same.
⇒ The only difference lies in the strategy to find the unknown macroscopic properties at the boundary.
◦
The impermeable wall condition is solved for boundary velocity:
3.3.6 Corners
In 2D domains, we have to deal with geometrical features where two straight surfaces intersect, called corners.
In 3D domains, we need to consider both edges and corners, i.e. places where two and three surfaces cross, respectively.
Corners and the Bounce-Back Rule: (a)
•
The bounce-back rule works in the same way for straight walls and corners, and it is the same for concave and convex cases
⇒ The unknown populations leaving corners are determined through the full reflection of the known incoming ones.
•
Concave corner: , , and unknown
•
Convex corner: only unknown
•
The advantages and disadvantages of the bounce-back rule for corners are similar to those at planar surfaces.
⇒ The ease of implementation, strict conservation of mass, and good stability characteristics (even close to ).
⇒ The lower accuracy, also featuring viscosity-dependent errors (if using the BGK model).
Corners and the NEBB Method: (b)
•
The main point is that we need to ensure that both known and unknown populations produce the desired macroscopic properties at corners, just as they do at straight boundaries.
⇒ Finding the corner density (pressure) generally requires extrapolation from neighbouring nodes.
⇒ All macroscopic quantities prescribed at corners (, , ) are known.
•
Concave corners (six unknowns: , , , , , ):
◦
Apply NEBB rule:
◦
Use conservation laws:
•
Convex corners (one unknown: ):
◦
Over-specified with full NEBB approach.
⇒ Often use simple (node) bounce-back rule:
3.3.7 Symmetry and Free-Slip Boundaries
Mirror Symmetry
•
For a symmetry plane lying exactly midway on the links between two rows of nodes, the populations on one side of the boundary must exactly mirror those on the other.
◦
For a symmetry plane lying at y: where (normal velocity reversed).
•
Implementation:
◦
Treat symmetry boundary as bounce-back-like mechanism where populations leaving boundary node at time meet symmetry surface at time .
◦
Populations undergo specular reflection with normal velocity component reversed from the incoming velocity : while maintaining same resulting velocity .
◦
Reflected populations arrive at time at node or neighboring boundary nodes.
◦
Standard streaming step replaced by:
▪
represents tangential velocity component of populations, equating and with their normal velocity set to zero.
Free-Slip Boundary
•
A free-slip boundary condition enforces a zero normal fluid velocity but places no restrictions on the tangential fluid velocity .
•
It can be implemented in exactly the same way as the symmetry boundary condition.
3.4 Further Topics on Boundary Conditions
3.4.1 The Chapman-Enskog Analysis for Boundary Conditions
•
LB boundary conditions rely on specific closure rules that differ from bulk collision and propagation rules.
•
Chapman-Enskog analysis can determine macroscopic behavior of LB boundary conditions.
Bounce-Back Method
•
Macroscopic Dirichlet velocity condition applies at lattice links rather than grid nodes.
⇒ The understanding of what happens at links must be examined in terms of continuation behaviour.
•
For the third-order boundary accuracy, use the second-order Taylor expansion:
◦
For a link-wise approach, to impose a wall velocity with formal third-order accuracy, its closure relation must satisfy above equation with
•
If the solution is time-independent, the second-order Chapman-Enskog analysis starts from linearized equilibrium:
•
The second-order Chapman-Enskog expansion of the bounce-back formula, , proceeds with the decomposition of its post-streaming and post-collision populations as follows (with ):
•
The steady-state macroscopic content of the bounce-back formula at node is obtained by performing some algebraic manipulations (using and ):
•
Assuming that this problem applies for a unidirectional horizontal flow aligned with the lattice so that and . → Only diagonal lattice links play a role.
⇒ The pressure terms have to be re-expressed in the form of velocity corrections (assuming a unidirectional pressure-driven flow): and
•
The steady closure relation for the bounce-back rule on a top wall can be re-expressed as:
◦
Viscosity-independent boundary location requires (remember that ).
◦
Other values lead to viscosity-dependent boundary shift or velocity slip.
Non-Equilibrium Bounce-Back Method
•
Wet boundary nodes operate with same dynamics as bulk nodes.
•
The NEBB method correctly reproduces macroscopic equation at wall:
•
The NEBB method exactly describes the pressure-driven (Poiseuille) channel flow on the boundary, thereby agreeing with the LBE in the bulk.
⇒ The NEBB is a third-order accurate boundary scheme for straight walls coinciding with lattice nodes.
3.4.2 Mass Conservation at Solid Boundaries
•
Mass conservation is crucial for compressible, multi-phase, or multi-component flows.
•
The LB algorithm ensures that mass is conserved locally since collision leaves invariant.
⇒ However, there is no a priori guarantee that this property holds at boundary nodes, which necessarily must behave differently than bulk fluid nodes.
Link-Wise Approach: Bounce-Back
•
Bounce-back places wall outside boundary node. → For straight walls, bounce-back is always mass conserving.
•
Mass is not conserved when:
◦
Normal mass flux is prescribed (e.g., normal velocity in Dirichlet correction).
◦
Boundary motions create or destroy fluid nodes to solid nodes and vice-versa.
◦
Boundary shapes don't align with lattice nodes. → Numerical errors due to the wall discretization contaminate the local mass balance.
Wet-Node Approach: Non-Equilibrium Bounce-Back
•
Boundary node considered in fluid domain, infinitesimally close to solid. → Reconstruction doesn't automatically conserve local mass.
•
For a top wall, the net mass on boundary node is:
•
Mass conservation up to for the NEBB:
•
Exact mass conservation methods exist but may degrade overall solution accuracy
3.4.3 Momentum Exchange at Solid Boundaries
•
The total force acting on a boundary area can be written as the surface integral of the traction vector :
◦
: the stress tensor at the surface.
◦
: the unit normal vector pointing from the surface into the fluid.
•
LBM allows direct access to the stress tensor without complicated computations.
⇒ In the bulk, the viscous shear stress follows directly from the second-order velocity moment of .
Momentum Exchange in the Bounce-Back Method
•
Momentum Exchange Algorithm (MEA) by Ladd:
◦
Identify those populations that cross the boundary (both from the fluid into the solid and the other way around).
◦
Sum up all corresponding momentum contributions to obtain the momentum exchange at the wall.
◦
Note that the MEA provides only the traction vector rather than the full stress tensor .
•
For each boundary link:
◦
Momentum exchange: .
•
Total momentum exchange is the sum of all those contributions by all bounced back populations:
1.
Identify all links between boundary and solid nodes with locations .
2.
At each time step, evaluate the incoming and bounced back populations and at each of the identified links.
3.
The total momentum exchange during one streaming step is the sum over all identified links and, due to , can be written as:
◦
The prefactor in 3D (or equivalently in 2D) ensures that the result is a momentum rather than a momentum density.
•
If we now assume that the momentum is exchanged smoothly during one time step , we can easily find the force acting on the boundary:
◦
Similarly, the angular momentum exchange and therefore the total torque acting on the wall can be computed.
⇒ Replace by where is a fixed reference point, e.g. the origin of the coordinate system.
Accuracy of the Momentum Exchange Method
•
The MEA provides an accurate measure of wall shear stress. → It can be verified via a Chapman-Enskog analysis.
•
The net tangential momentum transferred from fluid to solid across the wall, which is located midway between the solid node and the boundary node :
◦
In 3D: and . | In 2D: and .
•
First-order Taylor expansion of viscous stress :
◦
The MEA is second-order accurate and exact for parabolic solutions.
3.4.4 Boundary Conditions in 3D
•
Geometry differences: 2D has edges and corners; 3D has planes, edges, and corners.
•
Number of unknown populations for different lattices and boundary configurations.
•
Link-wise boundary methods specify the missing populations based on simple reflection rules, e.g. bounce-back. → The link-wise methods naturally extend to 3D.
•
Wet-node methods face challenges:
◦
Increased number of unknowns.
◦
Buried links in concave edges and corners.
◦
Over-constrained problems at convex nodes.
•
Wet-node boundary conditions may yield superior accuracy over bounce-back on flat surfaces.
◦
3D implementation challenges: Difficult due to need for distinguishing populations by wall orientation and cumbersome treatment of edge and corner nodes.
•
Link-wise boundary schemes do not distinguish between populations and are easy to implement (particularly bounce-back).
◦
General 3D recommendation: Link-wise boundary methods offer better compromise between accuracy and implementation ease compared to wet-node techniques.
3.5 Initial Conditions
3.5.1 Steady and Unsteady Situations
•
LB simulations fall into one of the following categories:
1.
Steady flows: The initial state does not affect the final outcome.
2.
Unsteady flows after long times: Statistical long-time behavior is usually independent of the initial state.
3.
Time-periodic flows: Fully converged time-periodic flows are independent of the details of the initialization.
4.
Initialization-sensitive flows: Entire fate of a simulation depends on the initial state (e.g., turbulence, decaying Taylor-Green vortex).
3.5.2 Initial Conditions in LB Simulations
Role of Populations and Macroscopic Fields
•
The mos common situation is that the initial solenoidal (divergence-free) velocity field is given, but neither the pressure nor the strain rate are known.
◦
One could be tempted to initialize the populations at equilibrium:
▪
: some initial constant density.
◦
This will lead to an inconsistent state because the Poisson equation for the initial pressure, , is not satisfied.
◦
If we assume for a moment that the initial pressure is known:
▪
where:
▪
The choice of is arbitrary as it is a mere scaling factor in all euqations.
•
The non-equilibrium populations is needed:
◦
For given velocity gradients and low fluid velocities, the BGK non-equilibrium can be approximated as:
▪
where:
•
General initialization:
Chicken or Egg? Order of Collision and Propagation
•
The equilibrium distribution, which is used for collision, is calculated using the known velocity and pressure fields.
◦
Initializing a simulation is basically the inverse of the velocity moments computation.
◦
Populations after initialization assume state compatible with post-propagation, pre-collision.
⇒ Initialization has to be followed by collision rather than propagation.
Consistent Initialization via Modified LB Scheme
•
Mei et al. algorithm:
1.
Initialize the populations , e.g. with the initial velocity according to .
2.
Compute the local density: .
3.
Perform collision using the modified incompressible equilibrium distributions .
⇒ Take the updated density field from step 2 but keep the initial velocity rather than recomputing it.
4.
Propagate
5.
Go back to step 2 and iterate until the populations have converged to a user-defined degree.
⇒ It is important to end this algorithm with propagation rather than collision; otherwise the non-equilibrium would be incorrect.
◦
The above algorithm effectively solves:
▪
Advection-diffusion equation for the density as a passive scalar field.
▪
Poisson equation for the pressure .
◦
A disadvantage of this initialization approach is that an initial force field is not taken into account.
◦
For the BGK model with , ensures velocity field matches input.
◦
Produces consistent initial populations including non-equilibrium part.