A cut-cell method for sharp moving boundaries in Cartesian grids

Meinke, Matthias; Schneiders, Lennart; Günther, Claudia; Schröder, Wolfgang

doi:10.1016/j.compfluid.2012.11.010

Cited by 64 publications

(32 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such geometries often stem from Computer Aided Design (CAD) software [1,2,3], from Computer Tomography (CT) images [4,5,6], or from laser-scan reconstructions of real-world objects. The number of representing surface elements varies with the resolution of the geometrical model.…”

Section: Introductionmentioning

confidence: 99%

“…In contrast, the generation of hierarchical Cartesian meshes can be executed completely automatically in a short amount of time [12,13,14]. Such meshes are well suited for complex geometries and are used for a variety of applications [2,3,6,15,16,17,18] in which the computational grids are generated from a geometrical surface representation given in STereo Lithography (STL) format. Lintermann et al [6] and Freitas et al [16] use a Lattice-Boltzmann Method (LBM) to simulate the biofluidmechanics of the human nasal cavity and the human lung.…”

Section: Introductionmentioning

confidence: 99%

“…They use the no-slip BFL-rule from Bouzidi et al [19] as wall boundary condition which requires the availability of the geometry for the distance calculation of boundary cell centers to the wall surface in the discrete LBM directions. In [2,17], a Finite-Volume Method (FVM) is used for the three-dimensional simulation of the flow in a combustion engine. The same method is applied for the simulation of tip-leakage flows in fan geometries [3] and turbulent helicopter engine jets [18].…”

Section: Introductionmentioning

confidence: 99%

“…The same method is applied for the simulation of tip-leakage flows in fan geometries [3] and turbulent helicopter engine jets [18]. In these publications, a cut-cell method [2,20] based on the geometry is used to accurately apply wall boundary conditions. Furthermore, in [2,15,17] a level-set mesh that allows for an efficient tracking of moving boundaries is constructed from the geometry.…”

Section: Introductionmentioning

confidence: 99%

“…In these publications, a cut-cell method [2,20] based on the geometry is used to accurately apply wall boundary conditions. Furthermore, in [2,15,17] a level-set mesh that allows for an efficient tracking of moving boundaries is constructed from the geometry. That is, the geometry is an essential element for pre-and in-simulation processing.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Efficient Parallel Geometry Distribution for the Simulation of Complex Flows

Lintermann¹

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. Highly resolved intrinsic geometrical shapes used in three-dimensional parallel simulations of fluid flows consume a large portion of the available memory when loaded serially on every process. This demands for a memory efficient implementation of a distributed geometry which is however a non-trivial task when complex spatial domain decomposition methods for the flow domain are involved. To overcome this problem, an algorithm to generate a parallel geometry during the mesh generation is proposed that enables a low-memory subdivision of the geometry based on the decomposition of the flow field. The applied meshing method generates computational grids that can be used for simulations on a quasi-arbitrary number of cores on which the geometry is distributed in an efficient preprocessing step. This allows reducing the number of instances of the geometry in the global memory of the simulation to about one. The algorithm is used to generate a parallel geometry for a large shape consisting of 7 · 10 6 triangles, i.e., for a geometry representing the whole respiratory tract down to the 12 th lung generation. For this case, performance and memory consumption measurements are given for simulations on 8,192 up to 131,072 cores and juxtaposed to results obtained from simulations using non-parallel geometries. The findings show that with the new method not only the memory usage could be reduced by the factors of 1,802 and 19,936 for core numbers of 8,192 and 131,072 but also a large speed-up factor of about 51 is obtained in the geometry I/O and preprocessing. Furthermore, the parallel geometry allows using the sweet spot with respect to a combination of distributed and shared memory parallelization leading to an increase of the computational speed of about 1.43.

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Efficient Parallel Geometry Distribution for the Simulation of Complex Flows

Lintermann¹

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

An immersed boundary solver for inviscid compressible flows

Liu

2017

Numerical Methods in Fluids

View full text Add to dashboard Cite

Summary In this paper, a simple and efficient immersed boundary (IB) method is developed for the numerical simulation of inviscid compressible Euler equations. We propose a method based on coordinate transformation to calculate the unknowns of ghost points. In the present study, the body‐grid intercept points are used to build a complete bilinear (2‐D)/trilinear (3‐D) interpolation. A third‐order weighted essentially nonoscillation scheme with a new reference smoothness indicator is proposed to improve the accuracy at the extrema and discontinuity region. The dynamic blocked structured adaptive mesh is used to enhance the computational efficiency. The parallel computation with loading balance is applied to save the computational cost for 3‐D problems. Numerical tests show that the present method has second‐order overall spatial accuracy. The double Mach reflection test indicates that the present IB method gives almost identical solution as that of the boundary‐fitted method. The accuracy of the solver is further validated by subsonic and transonic flow past NACA2012 airfoil. Finally, the present IB method with adaptive mesh is validated by simulation of transonic flow past 3‐D ONERA M6 Wing. Global agreement with experimental and other numerical results are obtained.

show abstract

Large eddy simulations of wall‐bounded flows using a simplified immersed boundary method and high‐order compact schemes

Tyliszczak

2018

Numerical Methods in Fluids

View full text Add to dashboard Cite

Summary This paper presents a solution algorithm based on an immersed boundary (IB) method that can be easily implemented in high‐order codes for incompressible flows. The time integration is performed using a predictor‐corrector approach, and the projection method is used for pressure‐velocity coupling. Spatial discretization is based on compact difference schemes and is performed on half‐staggered meshes. A basic algorithm for body‐fitted meshes using the aforementioned solution method was developed by A. Tyliszczak (see article “A high‐order compact difference algorithm for half‐staggered grids for laminar and turbulent incompressible flows” in Journal of Computational Physics) and proved to be very accurate. In this paper, the formulated algorithm is adapted for use with the IB method in the framework of large eddy simulations. The IB method is implemented using its simplified variant without the interpolation (stepwise approach). The computations are performed for a laminar flow around a 2D cylinder, a turbulent flow in a channel with a wavy wall, and around a sphere. Comparisons with literature data confirm that the proposed method can be successfully applied for complex flow problems. The results are verified using the classical approach with body‐fitted meshes and show very good agreement both in laminar and turbulent regimes. The mean (velocity and turbulent kinetic energy profiles and drag coefficients) and time‐dependent (Strouhal number based on the drag coefficient) quantities are analyzed, and they agree well with reference solutions. Two subfilter models are compared, ie, the model of Vreman (see article “An eddy‐viscosity subgrid‐scale model for turbulent shear flow: algebraic theory and applications” in Physics and Fluids) and σ model (Nicoud et al, see article “Using singular values to build a subgrid‐scale model for large eddy simulations” in Physics and Fluids). The tests did not reveal evident advantages of any of these models, and from the point of view of solution accuracy, the quality of the computational meshes turned out to be much more important than the subfilter modeling.

show abstract

A cut-cell method for sharp moving boundaries in Cartesian grids

Cited by 64 publications

References 29 publications

Efficient Parallel Geometry Distribution for the Simulation of Complex Flows

Efficient Parallel Geometry Distribution for the Simulation of Complex Flows

An immersed boundary solver for inviscid compressible flows

Large eddy simulations of wall‐bounded flows using a simplified immersed boundary method and high‐order compact schemes

Contact Info

Product

Resources

About