This paper aims to review the basic algorithm for 2D flow simulation around airfoils using the vortex particle method and to demonstrate that all time-consuming operations connected with the simulation of vorticity motion in the fluid domain, its generation on the airfoils in the flow, as well as some auxiliary operations, can be performed efficiently with quasilinear numerical complexity by using similar approaches. The suggested algorithms are based on the LBVH tree building and traversing. Specific features are discussed that enable an efficient implementation of the vortex particle method algorithm for CPUs and GPUs.
Vortex particle method is considered an efficient numerical method for flow simulation and fluid-structure interaction (FSI). An LBVH-tree-based (Linear Bounding Volumes Hierarchy) approach serves as a key tool for implementing approximate fast algorithms for all time-consuming operations in the main computational algorithm: from the N-body problem to the Boundary Integral Equation solution, neighbors search and penetration control.
Fast algorithms are proposed for all time-consuming operations in the computational algorithm of vortex particle method. Specific features are highlighted that are essential for efficient algorithm implementation on CPUs and GPUs.
The algorithms are developed precisely for two-dimensional flow simulation by vortex particle method. However, some ideas can be easily (or non-trivially!) generalized to the three-dimensional case.
The paper provides practical guidelines to specialists in CFD who deal with vortex particle method.
The authors have generalized their experience in developing efficient fast algorithms in the framework of vortex particle method. The developed approaches are mainly based on some known ideas, but all existing methods have required significant modifications to adapt them to the considered problems and improve their performance and accuracy.
