Physics of Fluids - Publications

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

Open Access
Journal of Computational Physics 375, 228 – 239 (2018)

Authors

	Vamsi Spandan
	Detlef Lohse
	M.D. de Tullio
	Roberto Verzicco

BibTeΧ

@article{SPANDAN2018228,
title = "A fast moving least squares approximation with adaptive Lagrangian mesh refinement for large scale immersed boundary simulations",
journal = "Journal of Computational Physics",
volume = "375",
pages = "228 - 239",
year = "2018",
issn = "0021-9991",
doi = "https://doi.org/10.1016/j.jcp.2018.08.040",
url = "http://www.sciencedirect.com/science/article/pii/S0021999118305710",
author = "Vamsi Spandan and Detlef Lohse and Marco D. de Tullio and Roberto Verzicco",
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."
}