Derivation and analysis of the analytical velocity and vortex stretching expressions for an O(N log N)-FMM

Journal Article (2016)
Author(s)

Tom Berdowski (TU Delft - Aerospace Engineering)

J. Walther (Technical University of Denmark (DTU))

Carlos Simao Ferreira (TU Delft - Aerospace Engineering)

Fanzhong Meng (Fraunhofer IWES)

Research Group
Wind Energy
DOI related publication
https://doi.org/10.1088/1742-6596/753/8/082023 Final published version
More Info
expand_more
Publication Year
2016
Language
English
Research Group
Wind Energy
Journal title
Journal of Physics: Conference Series
Volume number
753
Event
(2016-10-05 - 2016-10-07), Technische Universität München (TUM), Campus Garching, Munich, Germany
Downloads counter
306
Collections
Institutional Repository
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

In the current paper, a method for deriving the analytical expressions for the velocity and vortex stretching terms as a function of the spherical multipole expansion approximation of the vector potential is presented. These terms are essential in the context of 3D Lagrangian vortex particle methods combined with fast summation techniques. The convergence and computational efficiency of this approach is assessed in the framework of an O(N log N)-type Fast Multipole Method (FMM), by using vorticity particles to simulate a system of coaxial vortex rings for which also the exact results are known. It is found that the current implementation converges rapidly to the exact solution with increasing expansion order and acceptance factor. An investigation into the computational efficiency demonstrated that the O(N log N)-type FMM is already viable for a particle size of only several thousands and that this speedup increases significantly with the number of particles. Finally, it is shown that the implementation of the FMM with the current analytical expressions is at least twice as fast as when opting for using even the simplest implementation of finite differences instead.