Parallel adaptive weakly-compressible SPH for complex moving geometries

TL;DR

This paper advances adaptive weakly-compressible SPH methods by enabling efficient simulation of flows around moving and stationary geometries without background particles, demonstrated through various benchmark problems.

Contribution

It introduces a background-particle-free adaptive SPH formulation capable of handling complex moving geometries, improving computational efficiency and applicability.

Findings

Effective simulation of flow around moving bodies demonstrated

Reduced particle count compared to previous methods

Open source implementation available

Abstract

The use of adaptive spatial resolution to simulate flows of practical interest using Smoothed Particle Hydrodynamics (SPH) is of considerable importance. Recently, Muta and Ramachandran [1] have proposed an efficient adaptive SPH method which is capable of handling large changes in particle resolution. This allows the authors to simulate problems with much fewer particles than was possible earlier. The method was not demonstrated or tested with moving bodies or multiple bodies. In addition, the original method employed a large number of background particles to determine the spatial resolution of the fluid particles. In the present work we establish the formulation's effectiveness for simulating flow around stationary and moving geometries. We eliminate the need for the background particles in order to specify the geometry-based or solution-based adaptivity and we discuss the algorithms employed in detail. We consider a variety of benchmark problems, including the flow past two stationary cylinders, flow past different NACA airfoils at a range of Reynolds numbers, a moving square at various Reynolds numbers, and the flow past an oscillating cylinder. We also demonstrate different types of motions using single and multiple bodies. The source code is made available under an open source license, and our results are reproducible.