A fast multipole method for stellar dynamics

The approximate computation of all gravitational forces between N interacting particles via the fast multipole method (FMM) can be made as accurate as direct summation, but requires less than O(N) operations. FMM groups particles into spatially bounded cells and uses cell-cell interactions to approximate the force at any position within the sink cell by a Taylor expansion obtained from the multipole expansion of the source cell. By employing a novel estimate for the errors incurred in this process, I minimise the computational effort required for a given accuracy and obtain a well-behaved distribution of force errors. For relative force errors of ∼10−7, the computational costs exhibit an empirical scaling of ∝N0.87. My implementation (running on a 16 core node) out-performs a GPU-based direct summation with comparable force errors for N≳105.

[1]  L. Greengard,et al.  Regular Article: A Fast Adaptive Multipole Algorithm in Three Dimensions , 1999 .

[2]  Junichiro Makino,et al.  Optimal order and time-step criterion for Aarseth-type N-body integrators , 1991 .

[3]  Michael S. Warren,et al.  Skeletons from the treecode closet , 1994 .

[4]  J. Maxwell A Treatise on Electricity and Magnetism , 1873, Nature.

[5]  E. Hobson The Theory of Spherical and Ellipsoidal Harmonics , 1955 .

[6]  Makoto Taiji,et al.  Scientific simulations with special purpose computers - the GRAPE systems , 1998 .

[7]  James Reinders,et al.  Intel® threading building blocks , 2008 .

[8]  J. Read,et al.  N-body simulations of gravitational dynamics , 2011, 1105.1082.

[9]  Daniel J. Price,et al.  An energy‐conserving formalism for adaptive gravitational force softening in smoothed particle hydrodynamics and N‐body codes , 2006, astro-ph/0610872.

[10]  J. Applequist,et al.  Traceless cartesian tensor forms for spherical harmonic functions: new theorems and applications to electrostatics of dielectric media , 1989 .

[11]  Walter Dehnen Towards optimal softening in three-dimensional N-body codes - I. Minimizing the force error , 2000 .

[12]  Simon Portegies Zwart,et al.  SAPPORO: A way to turn your graphics cards into a GRAPE-6 , 2009, ArXiv.

[13]  Dehnen A Very Fast and Momentum-conserving Tree Code. , 2000, The Astrophysical journal.

[14]  D. Physics,et al.  A Comparison between the Fast Multipole Algorithm and the Tree-Code to Evaluate Gravitational Forces in 3-D , 1997, astro-ph/9703122.

[15]  Leon Cohen,et al.  A numerical integration scheme for the N-body gravitational problem , 1973 .

[16]  B. U. Felderhof,et al.  Reduced description of electric multipole potential in Cartesian coordinates , 1992 .

[17]  Leslie Greengard,et al.  A fast algorithm for particle simulations , 1987 .

[18]  H. Plummer On the Problem of Distribution in Globular Star Clusters: (Plate 8.) , 1911 .

[19]  Walter Dehnen,et al.  A Hierarchical O(N) Force Calculation Algorithm , 2002 .

[20]  R. W. James Transformation of Spherical Harmonics Under Change of Reference Frame , 1969 .

[21]  Kenjiro Taura,et al.  A Task Parallel Implementation of Fast Multipole Methods , 2012, 2012 SC Companion: High Performance Computing, Networking Storage and Analysis.

[22]  I. S. Gradshteyn,et al.  Table of Integrals, Series, and Products , 1976 .

[23]  D. Pinchon,et al.  Rotation matrices for real spherical harmonics: general rotations of atomic orbitals in space-fixed axes , 2007 .

[24]  Micha Sharir,et al.  A subexponential bound for linear programming , 1992, SCG '92.

[25]  Piet Hut,et al.  A hierarchical O(N log N) force-calculation algorithm , 1986, Nature.