A parallel algorithm for chimera grid with implicit hole cutting method

Abstract

The chimera grid methods have been widely used in the simulation of flow over complex configurations and unsteady moving boundary process. Lee and Baeder presented the implicit hole cutting (IHC) method, which improves the practicability and robustness of chimera grid method. But the excessive time consumption of this method restricts the scalability of parallelism. In this article, based on the parallel implementation of IHC method with structured multi-block grid, the factors which restrict the performance and efficiency are analyzed. Cartesian auxiliary grid is introduced to reduce the communication and computing cost. Finally, test cases are presented to demonstrate the effectiveness of this algorithm, and the calculation and data communication are reduced on the premise of maintaining accuracy.

A parallel dynamic overset grid framework for immersed boundary methods

“…Currently two types of hole-cutting algorithm are available: 1) explicit hole-cutting method (P.G. Buning, 1998;Petersson, 1999;Borazjani et al, 2013) in which the user specifies the hole points through the inputs to the algorithm, e.g., user-defined surfaces which are needed for utilizing the ray-tracing algorithm, or 2) implicit hole-cutting methods Baeder, 2002, 2003;Liao, Cai and Tsai, 2007;Hu, Lu, Zhang, Liu, Yuan, Liang and Zhang, 2019) in which no user-defined input other than the flow solver's boundary conditions are needed. The implicit hole cutting methods work based on an iterative approach for comparing volume grid information and flow boundary conditions to find the best resolution grid.…”