Fetching the paper…
Reading the bibliography…
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 $\mathcal{O}(N)$ operations.
Plummer HC (1911) On the problem of distribution in globular star clusters. MNRAS 71:460–470
1911
Earlier work this paper cites.
Hobson EW (1931) The theory of spherical and ellipsoidal harmonics. Cambridge, Cambridge University Press
1931
Earlier work this paper cites.
James RW (1969) Transformation of Spherical Harmonics Under Change of Reference Frame. Geophys J Intnl 17:305–316
1969
Earlier work this paper cites.
Ahmad A, Cohen L (1973) A numerical integration scheme for the N-body gravitational problem. J Comp Phys 12:389–402, DOI
1973
Earlier work this paper cites.
Barnes J, Hut P (1986) A Hierarchical O(NlogN) Force-Calculation Algorithm. Nature 324:446–449
1986
Earlier work this paper cites.
Greengard L, Rokhlin V (1987) A fast algorithm for particle simulations. J Comp Phys 73:325–348, DOI
1987
Earlier work this paper cites.
Applequist J (1989) Traceless cartesian tensor forms for spherical harmonic functions: new theorems and applications to electrostatics of dielectric media. Journal of Physics A Mathematical General 22:4303–4330, DOI
1989
Earlier work this paper cites.
Makino J (1991) Optimal order and time-step criterion for Aarseth-type N-body integrators. ApJ 369:200–212, DOI
1991
Earlier work this paper cites.
Hinsen K, Felderhof BU (1992) Reduced description of electric multipole potential in Cartesian coordinates. J Math Phys 33:3731–3735
1992
Earlier work this paper cites.
Gradshteyn IS, Ryzhik I (1994) Table of Integrals, Series, and Products, 5th edn. London, Academic Press
1994
Cited alongside, same era.
Salmon JK, Warren MS (1994) Skeletons from the treecode closet. J Comp Phys 111:136–155, DOI
1994
Cited alongside, same era.
Matoušek J, Sharir M, Welzl E (1996) A Subexponential Bound for Linear Programming. Algorithmica 16:498–516
1996
Cited alongside, same era.
Capuzzo-Dolcetta R, Miocchi P (1998) A comparison between the fast multipole algorithm and the tree-code to evaluate gravitational forces in 3-D. J Comp Phys 143:29–48, DOI
1998
Cited alongside, same era.
Makino J, Taiji M (1998) Scientific Simulations with Special-Purpose Computers–the GRAPE Systems. Wiley
1998
Cited alongside, same era.
Dehnen W (2002) A Hierarchical O(N) Force Calculation Algorithm. J Comp Phys 179:27–42
2002
Later among the works it cites.
Price DJ, Monaghan JJ (2007) An energy-conserving formalism for adaptive gravitational force softening in smoothed particle hydrodynamics and N-body codes. MNRAS 374:1347–1358, DOI
2006
Later among the works it cites.
Pinchon D, Hoggan PE (2007) Rotation matrices for real spherical harmonics: general rotations of atomic orbitals in space-fixed axes. J Phys A: Math Theor 40:1597–1610, DOI
2007
Later among the works it cites.
Reinders J (2007) Intel Threading Building Blocks. O’Reilly Media, Sebastopol
2007
Later among the works it cites.
Gaburov E, Harfst S, Portegies Zwart S (2009) SAPPORO: A way to turn your graphics cards into a GRAPE-6. New Astronomy 14(7):630–637, DOI
2009
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cheng H, Greengard L, Rokhlin V (1999) A Fast Adaptive Multipole Algorithm in Three Dimensions. J Comp Phys 155:468–498, DOI
1999
Cited alongside, same era.
Dehnen W (2000) A Very Fast and Momentum-conserving Tree Code. ApJ 536:L39–L42
2000
Cited alongside, same era.
Dehnen W (2001) Towards optimal softening in three-dimensional N-body codes - I. Minimizing the force error. MNRAS 324:273–291
2001
Cited alongside, same era.
Maxwell JC (1892) Treatise on Electricity and Magnetism. Oxford, Oxford University Press
Cited in the paper.
Dehnen W, Read JI (2011) N-body simulations of gravitational dynamics. European Physical Journal Plus 126:55, DOI
2011
Later among the works it cites.
Taura K, Nakashima J, Yokota R, Maruyama N (2012) A Task Parallel Implementation of Fast Multipole Methods. High Performance Computing, Networking Storage and Analysis, SC Companion: 0:617–625, http://doi.ieeecomputersociety.org/10.1109/SC.Companion.2012.86
2012
Later among the works it cites.
Fischer K, Gärtner B, Herrmann T, Hoffmann M, Schönherr S (2013) Bounding volumes. In: CGAL User and Reference Manual, 4.2 edn, CGAL Editorial Board, http://www.cgal.org/Manual/4.2
2013
Later among the works it cites.