A fast algorithm for simulation of periodic flows using discrete vortex particles

Ricciardi, Tulio R.; Wolf, William R.; Bimbato, Alex M. [UNESP]

A fast algorithm for simulation of periodic flows using discrete vortex particles

Arquivos

WOS000413699400022.pdf (1.76 MB)

Data

2017-11-01

Autores

Ricciardi, Tulio R.

Wolf, William R.

Bimbato, Alex M.

Editor

Springer

Tipo

Artigo

Direito de acesso

Acesso aberto

Resumo

We present a novel fast algorithm for flow simulations using the discrete vortex method, DVM, for problems with periodic boundary conditions. In the DVM, the solution of the velocity field induced by interactions among N discrete vortex particles is governed by the Biot-Savart law and, therefore, leads to a computational cost proportional to O(). The proposed algorithm combines exponential and power series expansions implemented using a divide and conquer strategy to accelerate the calculation of the cotangent kernel that models periodic boundary conditions. The fast multipole method, FMM, is applied for the solution of singular terms appearing in the power series expansion and also for the exponential series expansion. Error and computational cost analyses are performed for the individual steps of the algorithm for double and quadruple machine precision. The current method presents more accurate solutions when compared to those obtained by periodic domain replication using the free-field FMM kernel. The novel algorithm provides computational savings of nearly 240 times for double-precision simulations with one million particles when compared to the direct calculation of the Biot-Savart law.