Link-wise Artificial Compressibility Method

The Artificial Compressibility Method (ACM) for the incompressible Navier-Stokes equations is (link-wise) reformulated (referred to as LW-ACM) by a finite set of discrete directions (links) on a regular Cartesian mesh, in analogy with the Lattice Boltzmann Method (LBM). The main advantage is the possibility of exploiting well established technologies originally developed for LBM and classical computational fluid dynamics, with special emphasis on finite differences (at least in the present paper), at the cost of minor changes. For instance, wall boundaries not aligned with the background Cartesian mesh can be taken into account by tracing the intersections of each link with the wall (analogously to LBM technology). LW-ACM requires no high-order moments beyond hydrodynamics (often referred to as ghost moments) and no kinetic expansion. Like finite difference schemes, only standard Taylor expansion is needed for analyzing consistency. Preliminary efforts towards optimal implementations have shown that LW-ACM is capable of similar computational speed as optimized (BGK-) LBM. In addition, the memory demand is significantly smaller than (BGK-) LBM. Importantly, with an efficient implementation, this algorithm may be one of the few which is compute-bound and not memory-bound. Two- and three-dimensional benchmarks are investigated, and an extensive comparative study between the present approach and state of the art methods from the literature is carried out. Numerical evidences suggest that LW-ACM represents an excellent alternative in terms of simplicity, stability and accuracy.Comment: 62 pages, 20 figure

Reviving the local second-order boundary approach within the two-relaxation-time lattice Boltzmann modelling

This work addresses the Dirichlet boundary condition for momentum in the lattice Boltzmann method (LBM), with focus on the steady-state Stokes flow modelling inside non-trivial shaped ducts. For this task, we revisit a local and highly accurate boundary scheme, called the local second-order boundary (LSOB) method. This work reformulates the LSOB within the two-relaxation-time (TRT) framework, which achieves a more standardized and easy to use algorithm due to the pivotal parametrization TRT properties. The LSOB explicitly reconstructs the unknown boundary populations in the form of a Chapman–Enskog expansion, where not only first- but also second-order momentum derivatives are locally extracted with the TRT symmetry argument, through a simple local linear algebra procedure, with no need to compute their non-local finite-difference approximations. Here, two LSOB strategies are considered to realize the wall boundary condition, the original one called Lwall and a novel one Lnode, which operate with the wall and node variables, roughly speaking. These two approaches are worked out for both plane and curved walls, including the corners. Their performance is assessed against well-established LBM boundary schemes such as the bounce-back, the local second-order accurate CLI scheme and two different parabolic multireflection (MR) schemes. They are all evaluated for 3D duct flows with rectangular, triangular, circular and annular cross-sections, mimicking the geometrical challenges of real porous structures. Numerical tests confirm that LSOB competes with the parabolic MR accuracy in this problem class, requiring only a single node to operate

Real Time Wake Computations using Lattice Boltzmann Method on Many Integrated Core Processors

This paper puts forward an efficient Lattice Boltzmann method for use as a wake simulator suitable for real-time environments. The method is limited to low speed incompressible flow but is very efficient and can be used to compute flows “on the fly”. In particular, many-core machines allow for the method to be used with the need of very expensive parallel clusters. Results are shown here for flows around cylinders and simple ship shapes

Real Time Wake Computations using Lattice Boltzmann Method on Many Integrated Core Processors

This paper puts forward an efficient Lattice Boltzmann method for use as a wake simulator suitable for real-time environments. The method is limited to low speed incompressible flow but is very efficient and can be used to compute flows “on the fly”. In particular, many-core machines allow for the method to be used with the need of very expensive parallel clusters. Results are shown here for flows around cylinders and simple ship shapes

Detailed analysis of the lattice Boltzmann method on unstructured grids

The lattice Boltzmann method has become a standard for efficiently solving problems in fluid dynamics. While unstructured grids allow for a more efficient geometrical representation of complex boundaries, the lattice Boltzmann methods is often implemented using regular grids. Here we analyze two implementations of the lattice Boltzmann method on unstructured grids, the standard forward Euler method and the operator splitting method. We derive the evolution of the macroscopic variables by means of the Chapman-Enskog expansion, and we prove that it yields the Navier-Stokes equation and is first order accurate in terms of the temporal discretization and second order in terms of the spatial discretization. Relations between the kinetic viscosity and the integration time step are derived for both the Euler method and the operator splitting method. Finally we suggest an improved version of the bounce-back boundary condition. We test our implementations in both standard benchmark geometries and in the pore network of a real sample of a porous rock.Comment: 42 page