2017
DOI: 10.1016/j.cnsns.2017.04.005
|View full text |Cite
|
Sign up to set email alerts
|

Fast multipole method applied to Lagrangian simulations of vortical flows

Abstract: Lagrangian simulations of unsteady vortical flows are accelerated by the multi-level fast multipole method, FMM. The combination of the FMM algorithm with a discrete vortex method, DVM, is discussed for free domain and periodic problems with focus on implementation details to reduce numerical dissipation and avoid spurious solutions in unsteady inviscid flows. An assessment of the FMM-DVM accuracy is presented through a comparison with the direct calculation of the Biot-Savart law for the simulation of the tem… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
10
0
4

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 7 publications
(14 citation statements)
references
References 35 publications
(54 reference statements)
0
10
0
4
Order By: Relevance
“…The singular term of the cotangent series is solved using the FMM series expansion truncated with 40 and 75 terms for double and quadruple precision, respectively. These values guarantee machine precision [20]. In Fig.…”
Section: Fast Summation Of the Power Seriesmentioning
confidence: 83%
See 4 more Smart Citations
“…The singular term of the cotangent series is solved using the FMM series expansion truncated with 40 and 75 terms for double and quadruple precision, respectively. These values guarantee machine precision [20]. In Fig.…”
Section: Fast Summation Of the Power Seriesmentioning
confidence: 83%
“…Hence, these two methodologies are coupled to solve the approximation through the power series expansion. The methodology of the FMM used here is the standard one presented in the literature and the authors refer to the following references for details [10,17,20]. For particles with large separation along the yaxis, the exponential series expansion is employed.…”
Section: Fast Summation Algorithmmentioning
confidence: 99%
See 3 more Smart Citations