Full Eulerian deformable solid‐fluid interaction scheme based on building‐cube method for large‐scale parallel computing

Abstract

SummaryWe propose a full Eulerian incompressible solid‐fluid interaction scheme capable of achieving high parallel efficiency and easily generating meshes for complex solid geometries. While good scalability of a full Eulerian solid‐fluid interaction formulation has been reported by Sugiyama et al, their analysis was carried out using uniform Cartesian mesh and an artificial compressibility method. Typically, it is more challenging to achieve good scalability for hierarchical Cartesian meshes and a fully incompressible formulation. In addition, the conventional full Eulerian methods require a large computational cost to resolve complex solid geometries due to the usage of uniform Cartesian meshes. In an attempt to overcome the aforementioned issues, we employ the building‐cube method, where the computational domain is divided into cubic regions called cubes. Each cube is divided at equal intervals, the same number of cubes is assigned to each core, and the spatial loop processing is executed for each cube. The numerical method is verified by computing five numerical examples. In the weak scaling test, the parallel efficiency at 32768 cores with 32 cores as a reference is 93.6%. In the strong scaling test, the parallel efficiency at 32768 cores with 128 cores as a reference is 70.2%.