Related papers: Initialisation from lattice Boltzmann to multi-ste…
Lattice Boltzmann schemes are efficient numerical methods to solve a broad range of problems under the form of conservation laws. However, they suffer from a chronic lack of clear theoretical foundations. In particular, the consistency…
A new approach of implementing initial and boundary conditions for the lattice Boltzmann method is presented. The new approach is based on an extended collision operator that uses the gradients of the fluid velocity. The numerical…
Lattice Boltzmann schemes rely on the enlargement of the size of the target problem in order to solve PDEs in a highly parallelizable and efficient kinetic-like fashion, split into a collision and a stream phase. This structure, despite the…
Recently, the construction of finite difference schemes from lattice Boltzmann schemes has been rigorously analyzed [Bellotti et al. (2022), Numer. Math. 152, pp. 1-40]. It is thus known that any lattice Boltzmann scheme can be expressed in…
In this contribution, we address the numerical solutions of high-order asymptotic equivalent partial differential equations with the results of a lattice Boltzmann scheme for an inhomogeneous advection problem in one spatial dimension. We…
The classical method for deriving the macroscopic dynamics of a lattice Boltzmann system is to use a combination of different approximations and expansions. Usually a Chapman-Enskog analysis is performed, either on the continuous Boltzmann…
The off-lattice Boltzmann (OLB) method consists of numerical schemes which are used to solve the discrete Boltzmann equation. Unlike the commonly used lattice Boltzmann method, the spatial and time steps are uncoupled in the OLB method. In…
Numerical analysis for linear constant-coefficients Finite Difference schemes was developed approximately fifty years ago. It relies on the assumption of scheme stability and in particular -- for the $L^2$ setting -- on the absence of…
We develop the approach to the problem of integrable discretization based on the notion of $r$--matrix hierarchies. One of its basic features is the coincidence of Lax matrices of discretized systems with the Lax matrices of the underlying…
Adaptive lattice Boltzmann methods (LBMs) are based on velocity discretizations that self-adjust to local macroscopic conditions such as velocity and temperature. While this feature improves the accuracy and the stability of LBMs for large…
The lattice Boltzmann method has become a standard technique for simulating a wide range of fluid flows. However, the intrinsic coupling of momentum and space discretization restricts the traditional lattice Boltzmann method to regular…
We present a multi-scale lattice Boltzmann scheme, which adaptively refines particles' velocity space. Different velocity sets, i.e., higher- and lower-order lattices, are consistently and efficiently coupled, allowing us to use the…
In contrast to the commonly used lattice Boltzmann method, off-lattice Boltzmann methods decouple the velocity discretization from the underlying spatial grid, thus allowing for more efficient geometric representations of complex…
Biot's consolidation model is a classical model for the evolution of deformable porous media saturated by a fluid and has various interdisciplinary applications. While numerical solution methods to solve poroelasticity by typical schemes…
A unified framework to derive discrete time-marching schemes for coupling of immersed solid and elastic objects to the lattice Boltzmann method is presented. Based on operator splitting for the discrete Boltzmann equation, second-order…
We study the stability of one-dimensional linear lattice Boltzmann schemes for scalar hyperbolic equations with respect to boundary data. Our approach is based on the original raw algorithm on several unknowns, thereby avoiding the need for…
The pseudopotential model within the Lattice Boltzmann Method (LBM) framework has emerged as a prominent approach in computational fluid dynamics due to its dual strengths in physical intuitiveness and computational tractability. However,…
This paper discusses several (sub)gradient methods attaining the optimal complexity for smooth problems with Lipschitz continuous gradients, nonsmooth problems with bounded variation of subgradients, weakly smooth problems with H\"older…
A multiscale optimization framework for problems over a space of Lipschitz continuous functions is developed. The method solves a coarse-grid discretization followed by linear interpolation to warm-start project gradient descent on…
In this paper, we propose a computational framework,which is based on a domain decomposition technique, to employ both finite element method (which is a popular continuum modeling approach) and lattice Boltzmann method (which is a popular…