English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  A fast moving least squares approximation with adaptive Lagrangian mesh refinement for large scale immersed boundary simulations

Spandan, V., Lohse, D., de Tullio, M. D., & Verzicco, R. (2018). A fast moving least squares approximation with adaptive Lagrangian mesh refinement for large scale immersed boundary simulations. Journal of Computational Physics, 375, 228-239. doi:10.1016/j.jcp.2018.08.040.

Item is

Basic

show hide
Item Permalink: http://hdl.handle.net/21.11116/0000-0002-9C40-6 Version Permalink: http://hdl.handle.net/21.11116/0000-0002-9C41-5
Genre: Journal Article

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Spandan, V., Author
Lohse, Detlef1, Author              
de Tullio, M. D., Author
Verzicco, R., Author
Affiliations:
1Max Planck Institute for Dynamics and Self-Organization, Max Planck Society, ou_2063285              

Content

show
hide
Free keywords: Immersed boundary method; Moving least squares; Multiphase flows
 Abstract: In this paper we propose and test the validity of simple and easy-to-implement algorithms within the immersed boundary framework geared towards large scale simulations involving thousands of deformable bodies in highly turbulent flows. First, we introduce a fast moving least squares (fast-MLS) approximation technique with which we speed up the process of building transfer functions during the simulations which leads to considerable reductions in computational time. We compare the accuracy of the fast-MLS against the exact moving least squares (MLS) for the standard problem of uniform flow over a sphere. In order to overcome the restrictions set by the resolution coupling of the Lagrangian and Eulerian meshes in this particular immersed boundary method, we present an adaptive Lagrangian mesh refinement procedure that is capable of drastically reducing the number of required nodes of the basic Lagrangian mesh when the immersed boundaries can move and deform. Finally, a coarse-grained collision detection algorithm is presented which can detect collision events between several Lagrangian markers residing on separate complex geometries with minimal computational overhead.

Details

show
hide
Language(s): eng - English
 Dates: 2018-08-282018-12-15
 Publication Status: Published in print
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Method: Peer
 Identifiers: DOI: 10.1016/j.jcp.2018.08.040
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Journal of Computational Physics
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 375 Sequence Number: - Start / End Page: 228 - 239 Identifier: -