The fast multipole method (FMM) is a fast summation algorithm capable of accelerating pairwise interaction calculations, known as N-body problems, from an algorithmic complexity of (N2) to (N) for N particles. The algorithm has brought a dramatic increase in the capability of particle simulations in many application areas, such as electrostatics, particle formulations of fluid mechanics, and others. Although the literature on the subject provides theoretical error bounds for the FMM approximation, there are not many reports on the measured errors in a suite of computational experiments that characterize the accuracy of the method in relation with the different parameters available to the user. We have performed such an experimental investigation, and summarized the results of about 1500 calculations using the FMM algorithm, applied to the 2D vortex particle method. In addition to the more standard diagnostic of the maximum error, we supply illustrations of the spatial distribution of the errors, offering visual evidence of all the contributing factors to the overall approximation accuracy: multipole expansion, local expansion, hierarchical spatial decomposition (interaction lists, local domain, far domain). This presentation is a contribution to any researcher wishing to incorporate the FMM acceleration to their application code, as it aids in understanding where accuracy is gained or compromised. Copyright © 2009 John Wiley & Sons, Ltd.
[1]
Alessandro Curioni,et al.
Billion vortex particle direct numerical simulations of aircraft wakes
,
2008
.
[2]
Csaba Gáspár,et al.
A multipole expansion technique in solving boundary integral equations
,
1998
.
[3]
L. Barba,et al.
Advances in viscous vortex methods—meshless spatial adaption based on radial basis function interpolation
,
2005
.
[4]
Marcia O. Fenley,et al.
Fast adaptive multipole method for computation of electrostatic energy in simulations of polyelectrolyte DNA
,
1996,
J. Comput. Chem..
[5]
Andrew W. Appel,et al.
An Efficient Program for Many-Body Simulation
,
1983
.
[6]
Petros Koumoutsakos,et al.
Vortex Methods: Theory and Practice
,
2000
.
[7]
Jack J. Dongarra,et al.
Guest Editors Introduction to the top 10 algorithms
,
2000,
Comput. Sci. Eng..
[8]
Piet Hut,et al.
A hierarchical O(N log N) force-calculation algorithm
,
1986,
Nature.
[9]
Matthew G. Knepley,et al.
Fast Multipole Method for particle interactions: an open source parallel library component
,
2010
.
[10]
Leslie Greengard,et al.
A fast algorithm for particle simulations
,
1987
.
[11]
George Majda,et al.
On the Rokhlin-Greengard method with vortex blobs for problems posed in all space or periodic in one direction
,
1995
.
[12]
Lorena A. Barba,et al.
NUMERICAL INVESTIGATIONS ON THE ACCURACY OF THE VORTEX METHOD WITH AND WITHOUT REMESHING.
,
2003
.