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

From MaRDI portal
Publication:2002242

DOI10.1016/J.JCP.2018.08.040zbMATH Open1416.76230arXiv1805.01113OpenAlexW2798874464MaRDI QIDQ2002242FDOQ2002242

Vamsi Spandan, R. Verzicco, M. D. de Tullio, Detlef Lohse

Publication date: 11 July 2019

Published in: Journal of Computational Physics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1805.01113





Cites Work


Cited In (10)






This page was built for publication: A fast moving least squares approximation with adaptive Lagrangian mesh refinement for large scale immersed boundary simulations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2002242)