A dynamic mesh refinement technique for Lattice Boltzmann simulations on octree-like grids

Neumann, Philipp; Neckel, Tobias

doi:10.1007/s00466-012-0721-y

Cited by 22 publications

(32 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We are not the first group setting up such a solver. However, there are a few major differences to other approaches: [55] and [56] both implement the lattice-Boltzmann method on top of a highly optimised octree grid implementation. I.e., the solver itself had to be developed more or less from scratch in a way that is adapted to the grid structure and its specific memory-optimal traversal in the Peano framework [57] or waLBerla [58].…”

Section: Discussionmentioning

confidence: 99%

Towards Lattice-Boltzmann on Dynamically Adaptive Grids — Minimally-Invasive Grid Exchange in Espresso

Lahnert¹,

Burstedde²,

Holm³

et al. 2016

Proceedings of the VII European Congress on Computational Methods in Applied Sciences and Engineering (ECCOMAS Congress 2016)

View full text Add to dashboard Cite

Abstract. We present the minimally-invasive exchange of the regular Cartesian grid in the lattice-Boltzmann solver of ESPResSo by a dynamically-adaptive octree grid. Octree grids are favoured by computer scientists over other grid types as they are very memory-efficient. In addition, they represent a natural generalisation of regular Cartesian grids, such that most discretisation details of a regular grid solver can be maintained. Optimised codes, however, require a special tree-oriented grid traversal, which typically conflicts with existing simulation codes using various iterators, some for only parts of the grid, e.g., boundaries. ESPResSo is a large software package developed for soft-matter simulations involving fluid flow, electrostatic, and electrokinetic effects, and molecular dynamics. The currently used regular Cartesian grid hinders the simulation of realistic domain sizes and significant time periods, a problem that can be solved using grid adaptivity. In a first step, we focus on the lattice-Boltzmann flow solver in ESPResSo.p4est is a grid framework, that already provides dynamically adaptive quadtree and octree grids together with high-level interfaces for flexible grid traversals with direct neighbour access in all grid components. In this paper, we first describe extensions of p4est that were necessary to fulfill certain application requirements. The second part of our work consists of the minimally-invasive changes in ESPResSo preserving the expertise accumulated in the software's implementation over years. Our numerical results demonstrate physical correctness of the implementation, good parallel scalability and low overhead of the dynamical grid adaptivity. These are prerequisites to actually profit from grid adaptivity in terms of being able to simulate larger domains over longer time periods with limited computational resources. Thus, the current status forms a solid basis for further steps such as the development of refinement criteria, the setup of more realistic application scenarios, and a GPU implementation.

show abstract

Section: Discussionmentioning

confidence: 99%

Towards Lattice-Boltzmann on Dynamically Adaptive Grids — Minimally-Invasive Grid Exchange in Espresso

Lahnert¹,

Burstedde²,

Holm³

et al. 2016

Proceedings of the VII European Congress on Computational Methods in Applied Sciences and Engineering (ECCOMAS Congress 2016)

View full text Add to dashboard Cite

show abstract

“…The Lattice Boltzmann model and the respective slip and transition flow extensions are implemented within the Lattice Boltzmann application [11,32] of the Peano framework [33]. This framework provides adaptive Cartesian grid structures that are traversed along the iterates of the space-filling Peano curve.…”

Section: The Peano Frameworkmentioning

confidence: 99%

“…This framework provides adaptive Cartesian grid structures that are traversed along the iterates of the space-filling Peano curve. A block-structured approach to LBM-based simulations within Peano has recently been presented and validated; for details, see [11]. The respective implementation allows for two-and three-dimensional Lattice Boltzmann simulations on adaptive static or dynamic Cartesian grids.…”

Section: The Peano Frameworkmentioning

confidence: 99%

“…It enables coarse-graining and refining of both the spatial resolution of the simulation and the properties of the fluid. The latter can for example be established by using different collision models on different grid levels which can significantly reduce computational costs as pointed out in [11].…”

Section: The Peano Frameworkmentioning

confidence: 99%

“…In the present contribution, we present the extension of our existing adaptive LBM implementation within the Peano framework [11] to the slip and transition flow regime. The methods are based on the models proposed in [2] and [6], respectively.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Lattice Boltzmann Simulations in the Slip and Transition Flow Regime with the Peano Framework

Neumann

Rohrmann²

2012

OJFD

Self Cite

View full text Add to dashboard Cite

We present simulation results of flows in the finite Knudsen range, which is in the slip and transition flow regime. Our implementations are based on the Lattice Boltzmann method and are accomplished within the Peano framework. We validate our code by solving two-and three-dimensional channel flow problems and compare our results with respective experiments from other research groups. We further apply our Lattice Boltzmann solver to the geometrical setup of a microreactor consisting of differently sized channels and a reactor chamber. Here, we apply static adaptive grids to further reduce computational costs. We further investigate the influence of using a simple BGK collision kernel in coarse grid regions which are further away from the slip boundaries. Our results are in good agreement with theory and non-adaptive simulations, demonstrating the validity and the capabilities of our adaptive simulation software for flow problems at finite Knudsen numbers.

show abstract

Computational Morphogenesis: Morphologic constructions using polygonal discretizations

Choi

Chi

Park

et al. 2020

Numerical Meth Engineering

View full text Add to dashboard Cite

To consistently coarsen arbitrary unstructured meshes, a computational morphogenesis process is built in conjunction with a numerical method of choice, such as the virtual element method with adaptive meshing. The morphogenesis procedure is performed by clustering elements based on a posteriori error estimation. Additionally, an edge straightening scheme is introduced to reduce the number of nodes and improve accuracy of solutions. The adaptive morphogenesis can be recursively conducted regardless of element type and mesh generation counting. To handle mesh modification events during the morphogenesis, a topology-based data structure is employed, which provides adjacent information on unstructured meshes. Numerical results demonstrate that the adaptive mesh morphogenesis effectively handles mesh coarsening for arbitrarily shaped elements while capturing problematic regions such as those with sharp gradients or singularity.

show abstract

A dynamic mesh refinement technique for Lattice Boltzmann simulations on octree-like grids

Cited by 22 publications

References 41 publications

Towards Lattice-Boltzmann on Dynamically Adaptive Grids — Minimally-Invasive Grid Exchange in Espresso

Towards Lattice-Boltzmann on Dynamically Adaptive Grids — Minimally-Invasive Grid Exchange in Espresso

Lattice Boltzmann Simulations in the Slip and Transition Flow Regime with the Peano Framework

Computational Morphogenesis: Morphologic constructions using polygonal discretizations

Contact Info

Product

Resources

About