A flexible level-set approach for tracking multiple interacting interfaces in embedded boundary methods

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

doi:10.1016/j.compfluid.2014.06.023

Cited by 50 publications

(17 citation statements)

References 61 publications

(94 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Multiple triangulated surface meshes are combined, and additional geometry is added (or subtracted) using the level set merging algorithm of Schroder et al , . In this approach, level sets ( γ i ) for each surface mesh are first constructed, where i represents the i t h surface mesh.…”

Section: Algorithm Formulationmentioning

confidence: 99%

“…In this approach, level sets ( γ i ) for each surface mesh are first constructed, where i represents the i t h surface mesh. Merging of level sets follows the assembly procedure, where for all subsequent level‐set functions, γ i , i > 1 are compared with γ 0 using the following rules , If both values are positive, set γ 0 = m i n ( γ 0 , γ i ) If both values are negative, set

γ^{0} = - \sqrt{{(γ^{0})}^{2} + {(γ^{i})}^{2}}

if values have different signs, set γ 0 = m i n ( γ 0 , γ i ) …”

Section: Algorithm Formulationmentioning

confidence: 99%

“…In this approach, level sets ( i ) for each surface mesh are first constructed, where i represents the i th surface mesh. Merging of level sets follows the assembly procedure, where for all subsequent level-set functions, i , i > 1 are compared with 0 using the following rules [16],…”

Section: Mapping Of Multiple Stls To a Level Setmentioning

confidence: 99%

See 2 more Smart Citations

Initialization of high‐order accuracy immersed interface CFD solvers using complex CAD geometry

DesJardin

Bojko

McGurn

2016

Numerical Meth Engineering

View full text Add to dashboard Cite

Summary This study concerns the development of a numerical methodology for initializing immersed interface‐based CFD solvers for using complex computer‐aided design (CAD) geometry. CFD solvers with higher‐order discretization stencils require larger stencil widths, which become problematic in regions of space where insufficient mesh resolution is available. This problem becomes especially challenging when convoluted triangulated surface meshes generated from complex solid models are used to initialize the cut‐cells. A pragmatic balance between desired local geometry resolution and numerical accuracy is often required to find a practical solution. Here, a robust iterative fill algorithm is presented that balances geometry resolution with numerical accuracy (via stencil size). Several examples are presented to illustrate the use of this initialization procedure that employs both the original CAD generated triangulated surface mesh, along with a level set representation of the surface to initialize cut‐cells and boundary proximity measures for creation of CFD stencils. Convergence error analysis of surface area and enclosed volumes is first presented to show the effects of fill on the geometry as a function of desired stencil size and grid resolution. The algorithm is then applied to geometrically complex problems using large eddy simulation. Two problems are considered. The first is flow around the Eiffel Tower. The second is a combustion swirler in the context of a design problem. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Section: Algorithm Formulationmentioning

confidence: 99%

γ^{0} = - \sqrt{{(γ^{0})}^{2} + {(γ^{i})}^{2}}

if values have different signs, set γ 0 = m i n ( γ 0 , γ i ) …”

Section: Algorithm Formulationmentioning

confidence: 99%

See 1 more Smart Citation

Initialization of high‐order accuracy immersed interface CFD solvers using complex CAD geometry

DesJardin

Bojko

McGurn

2016

Numerical Meth Engineering

View full text Add to dashboard Cite

show abstract

“…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%

“…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%

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

An efficient numerical method for fully‐resolved particle simulations on high‐performance computers

Schneiders

Grimmen

Meinke

et al. 2015

Proc Appl Math and Mech

Self Cite

View full text Add to dashboard Cite

A numerical method for fully-resolved particle simulations on adaptively-refined Cartesian meshes is presented. When the particle size is on the order of or smaller than the smallest scales of the carrier flow, fully resolving the particle surfaces on uniform Cartesian meshes results in a tremendous computational effort. This is circumvented by locally refining the mesh near the moving particle surfaces. A new dynamic load-balancing strategy is described which enables the application of this approach to particulate turbulent flows on high-performance computers.

show abstract

A flexible level-set approach for tracking multiple interacting interfaces in embedded boundary methods

Cited by 50 publications

References 61 publications

Initialization of high‐order accuracy immersed interface CFD solvers using complex CAD geometry

Initialization of high‐order accuracy immersed interface CFD solvers using complex CAD geometry

Efficient Parallel Geometry Distribution for the Simulation of Complex Flows

An efficient numerical method for fully‐resolved particle simulations on high‐performance computers

Contact Info

Product

Resources

About