Open Access

A fast multipole method for stellar dynamics

Computational Astrophysics and CosmologySimulations, Data Analysis and Algorithms20141:1

DOI: 10.1186/s40668-014-0001-7

Received: 30 January 2014

Accepted: 30 April 2014

Published: 11 September 2014

Abstract

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 N 0.87 . My implementation (running on a 16 core node) out-performs a GPU-based direct summation with comparable force errors for N 10 5 .

Keywords

methods: numerical methods: N-body simulations

1 Background

The computation of the mutual gravitational forces at every time step dominates the computational costs of all N-body simulations. When simulating collisionless stellar dynamics, the N-body model is merely a Monte-Carlo representation of a smooth phase-space distribution and the N-body force is only ever an estimate for the smooth force field of the continuous system modelled (see also Dehnen and Read [2011]). In particular, the N-body force unavoidably carries an estimation error. This motivates the use of approximate methods for computing the N-body force, such as the Barnes and Hut ([1986]) tree code, as long as the approximation errors are small compared to the estimation errors.

N-body simulations of collisional stellar dynamics are of a completely different nature. Here, the particles simulate individual stars and the N-body force carries no estimation error. Consequently, the (negative) gravitational potential
Ψ ( x b ) = a b G μ a ψ ( x b x a ) with  ψ ( r ) = | r | 1
(1)

and its derivative, the acceleration, must be calculated with high accuracy. This is typically achieved by direct summation, when equation (1) is translated into computer code and the only errors are owed to finite computational precision.

This computation incurs a cost of O ( N ) for a single particle and thus O ( N 2 ) per unit time for running a full simulation. As a consequence, realistic simulations with N 10 6 - 7 for globular clusters and galactic centres are still very challenging and large parameter studies impossible. Measures employed to ameliorate this situation include the usage of powerful special-purpose hardware devices (Makino and Taiji [1998]) or graphical processing units (GPUs, Gaburov et al. [2009]), as well as separating the highly fluctuating forces due to close neighbours, in order to reduce the frequency of expensive far-field force computations (Ahmad and Cohen [1973]).

While these measures substantially reduce the effective costs, the complexity of N 2 remains. The alternative of using approximate methods also for collisional stellar dynamics is so far untested. The requirements for such a method differ from that in collisionless N-body methods in two important aspects: (i) there is no gravitational softening and (ii) to preserve the validity of the N-body model, the approximation errors must be much smaller than what is common in collisionless N-body simulations.

A straightforward approach is to use the tree code with a small opening angle and/or high expansion order, resulting in a scheme with O ( N ln N ) costs. A more efficient approach is to use the fast multipole method (FMM; Greengard and Rokhlin [1987]; Cheng et al. [1999]) which has costs of only O ( N ) . An initial attempt by Capuzzo-Dolcetta and Miocchi ([1998]) to port this technique from its original realm of molecular dynamics to astrophysics failed to obtain better practical efficiency than the tree code. However, when adapting the FMM to the inhomogeneity of stellar systems and the low force accuracy required in collisionless dynamics (by using a hierarchical tree data structure and a flexible opening angle), it is substantially faster than the tree code (Dehnen [2000], [2002]).

The critical question here is whether FMM can be tuned to be more efficient than direct summation at force accuracies and particle numbers required by collisional N-body techniques. The goal of this study is to address this question by tuning FMM for the application to collisional N-body simulations, investigating the resulting dependence of computational costs and numerical accuracy on the various numerical parameters, and assessing its practical efficiency.

This paper is organised as follows. In Section 2 and Appendix A, the mathematical (and algorithmic) foundations of FMM are derived and laid down. Section 3 (and Appendix B) introduces and motivates my approach for quantifying the resulting acceleration errors; Section 4 provides useful estimates for the errors of individual FMM interactions; Section 5 deals with optimising the multipole-acceptance criterion; and in Section 6 the method is tuned to obtain a force accuracy target with minimal computational effort. Finally, in Section 7 possible extensions and applications are discussed, and Section 8 concludes.

2 FMM basics

The tree code approximates the sum (1) by first dividing source particles a into groups bounded by geometric cells, each of which is well-separated from the sink position x b , and then computing the forces of each source cell from their multipole moments. This corresponds to Taylor expanding the Greens function ψ ( x b x a ) about the distance to an appropriate centre z of each source cell.

The essence of the fast multipole method is to Taylor expand the Greens function not only at the source positions x a , but also at the sink positions x b . This latter amounts to approximating (a contribution to) the gravitational field within each sink cell by its local Taylor expansion about some appropriate potential expansion centre s. Obviously, this approach is beneficial only if the forces for a large fraction of the sinks within a cell are to be computed simultaneously.

2.1 Mathematical background

The FMM relations are most easily derived using Cartesian coordinates. However, for Newtonian gravity, ψ = | r | 1 , the resulting relations are inefficient. Instead, exploiting that this Greens function satisfies 2 ψ = 0 for r 0 naturally leads to spherical harmonics. Cheng et al. ([1999]) have already given (without derivation) the corresponding FMM relations, but in a form ill-suited for computer code. In Appendix A, I derive equivalent but much more compact and computationally convenient relations. These are summarised here.

Let r = ( x , y , z ) with spherical polar coordinates r, θ, ϕ, then
Θ n m ( r ) = ( 1 ) m ( n m ) ! r n + 1 P n m ( cos θ ) e i m ϕ ,
(2a)
ϒ n m ( r ) = ( 1 ) m r n ( n + m ) ! P n m ( cos θ ) e i m ϕ
(2b)
with integer indices 0 | m | n are (complex-valued) harmonic functions, i.e. 2 ϒ n m = 0 for all r and 2 Θ n m = 0 for all r 0 . The ϒ n m are homogeneous polynomials of total degree n in x, y, and z (they are defined in Appendix A.3 without reference to polar coordinates; see also Table 3). With these definitions, the FMM relations for the computation of the potential due to all particles within source cell A and at any position x b within sink cell B are
Ψ A B ( x b ) = n = 0 p m = n n ϒ n m ( s B x b ) F n m ( s B ) + δ Ψ A B ,
(3a)
F n m ( s B ) = k = 0 p n l = k k M k l ( z A ) Θ n + k m + l ( s B z A ) ,
(3b)
M n m ( z A ) = a A μ a ϒ n m ( x a z A ) .
(3c)

Here, p is the expansion order and δ Ψ A B the error of the approximated potential. This expansion converges with increasing p if max a A { | x b x a r | } < | r | with r s B z A .

Other important relations are those for the multipoles M n m with respect to another expansion centre
M n m ( z ) = k = 0 n l = k k ϒ k l ( z z ) M n k m l ( z ) ,
(3d)
and for the field tensors F n m of the local expansion (3a) with respect to another expansion centre
F n m ( s ) = k = 0 p n l = k k ϒ k l ( s s ) F n + k m + l ( s ) .
(3e)
Moreover, the computation of the acceleration a from the local expansion (3a) requires
Ψ n m ( x b ) = k = 0 p n l = k k ϒ k l ( s B x b ) F n + k m + l ( s B ) + δ Ψ n m ,
(3f)
when a = Ψ 0 0 = ( { Ψ 1 1 } , { Ψ 1 1 } , Ψ 1 0 ) . Finally, the gravity generated from a source distribution with given multipoles is given by
Ψ n m ( x b ) = k = 0 p n l = k k M k l ( z A ) Θ n + k m + l ( x b z A ) + δ Ψ n m .
(3g)

Relations (3b), (3d), and (3e) are equivalent to the much more complicated equations (17), (13), and (21) of Cheng et al. ([1999]), given without derivation.1

There are ( p + 1 ) 2 independent real-valued numbers F n m (as well as M n m , see also Appendix A.5.2), and their computation via equations (3b), (3d), and (3e) requires O ( p 4 ) operations.2 These operation counts can be reduced to O ( p 3 ) by rotating r into the z direction (see Appendix A.6). Figure 1 plots the time required per interaction computation as function of expansion order p, showing an effective p 2.3 scaling of the computational costs at p 10 , shallower than the O ( p 3 ) asymptote.
https://static-content.springer.com/image/art%3A10.1186%2Fs40668-014-0001-7/MediaObjects/40668_2014_Article_1_Fig1_HTML.jpg
Figure 1

Timings for the M2L kernel. The time taken by the M2L kernel (using double precision without vectorisation) as function of expansion order p. The rotation accelerated version of Appendix A.6.2 is faster than the direct implementation of equation (3b) for p 5 .

2.2 Algorithmic approach

2.2.1 The tree code: walking the tree

Let us first consider the tree code, which also uses the multipole expansion but is algorithmically simpler than FMM. The basic data structure is a hierarchical tree of spatial cells, which are either cubic with eight daughters cells (oct-tree) or cuboidal with two daughters (binary tree). In a first step, the multipoles M n m have to be computed for each cell from those of their daughter cells, using the M2M kernel (equation (3d), see also Table 1), or (in case of final cells) of their particles, using the P2M kernel (equation (3c)).
Table 1

The FMM kernels

Name

Meaning

Equation

P2P

particle to particle

(1)

P2M

particle to multipole

(3c)

M2M

multipole to multipole

(3d)

M2P

multipole to particle

(3g)

M2L

multipole to local expansion

(3b)

P2L

particle to local expansion

see table legend

L2L

local expansion to local expansion

(3e)

L2P

local expansion to particle

(3f)

The tree code replaces direct summation (P2P) with P2M-M2M-M2P, while FMM uses P2M-M2M-M2L-L2L-L2P, see also Figure 2. The P2L kernel corresponds to equation (3b) with z A x a and M k l m a δ k 0 , i.e. F n m ( s B ) = m a Θ n m ( s B x a ) .

Next, the force for each sink position is computed using a separate tree walk starting with the root cell. The force generated by a cell C is computed via its multipole expansion, using the M2P kernel (equation (3g)), if a multipole-acceptance criterion is met, i.e. if the cell is considered to be well-separated from the sink position. Otherwise, the cell is opened: the force is computed as the sum of the forces generated by the daughters cells (recursing if necessary). Thus, the tree code replaces direct summation’s P2P kernel with the P2M, M2M, and M2P kernels, see the left panel of Figure 2 for a schematic view.
https://static-content.springer.com/image/art%3A10.1186%2Fs40668-014-0001-7/MediaObjects/40668_2014_Article_1_Fig2_HTML.jpg
Figure 2

Schematic view of the tree code (left) and FMM (right). The tree code approximates the force from a source particle (blue star) at a sink position (red star) using the P2M and M2M kernels (green arrows) to compute the multipoles at the cell centres (blue circles) followed by the M2P kernel (pink arrow). The P2M and M2M kernels are called once per source particle and cell, respectively, while the M2P kernel is called many times for each sink position. FMM replaces many calls to the M2P kernel by a single call to the M2L kernel (red arrow) followed by the L2L and L2P kernels (green arrows). Again, the L2L and L2P kernels are called once per sink cell and particle, respectively, but a single M2L kernel replaces many M2P kernels of the tree code, because it accounts for all sink positions within the sink cell.

2.2.2 FMM: the dual tree walk

An adaptive FMM algorithm also uses a hierarchical tree data structure. As with the tree code, the cell multipoles M n m have to be precomputed for every cell in a first step.

Next, the forces for all sink positions and generated by all source particles are approximated using a single dual tree walk (Dehnen [2002]). This algorithm considers cell → cell interactions and starts with the root → root interaction. If the interacting cells are well separated, the interaction is approximated using the M2L kernel (equation (3b)), which computes and accumulates the local field tensors F n m ( s B ) for the expansion of gravity within the sink cell B and due to all sources within the source cell A (in a mutual version of the algorithm, the interactions A B and B A are considered simultaneously). Otherwise, the interaction is split, typically into those between the daughters of the larger of the two interacting cells with the smaller.

Finally, the local field tensors F n m ( s ) are passed down the tree using the L2L kernel, and the local expansions are evaluated at the sink positions using the L2P kernel. Thus, the FMM replaces the M2P kernel of the tree code with the M2L, L2L and L2P kernels, see also Figure 2.

Of course, in both tree code and FMM, direct summation (P2P kernel) is used whenever computationally preferable, i.e. for interactions involving only a few sources and sinks.

3 Quantifying the approximation accuracy

Before the method can optimised for accuracy, a sensible quantitative measure for this accuracy is needed as well as an acceptable value for this measure.

With direct-summation, the accuracy is limited only by the finite precision of computer arithmetic (round-off error). If double (64-bit) precision is not used throughout, it is customary to use the conservation of the total energy for quality control (e.g. Gaburov et al. [2009]). However, as shown in Appendix B, the relative energy error is much smaller than the typical relative force error, simply because it is an average over many force errors. Even worse, the computation of the total energy, required for measuring its error, typically incurs a larger error. Thus, any measured non-conservation of the total energy is dominated by measurement error rather than true non-conservation due to acceleration errors.

With the tree code and FMM, the situation is subtly different, as discussed in Appendix B.3. Here, the measured non-conservation of energy actually reflects the amplitude of the acceleration errors in an average sense. However, an average measure for the effect of approximation errors cannot reflect their effect on the correctness of the simulation. For example, a single large force error has hardly any effect on the energy conservation but may seriously affect the validity of the simulation. While this latter goal is difficult to quantify, it is certainly better to consider the whole distribution of acceleration errors and pay particular attention to large-error outliers, than merely monitor an average.

3.1 Scaling acceleration errors

Obviously, the absolute errors δ a = | a computed a true | are not very useful by themselves and must be normalised to be meaningful. One option is to divide δa by some mean field strength a ¯ . While this makes sense for the average particle, it fails for those in the outskirts of the stellar system, where the field strength diminishes well below its mean.

To overcome such issues, a natural choice is the relative error δ a / a . However, this is still problematic in the centre of a stellar system, where forces from the outward lying parts largely cancel. In such a situation, a can be small and hence the relative error large, even if each individual pair-wise force has been computed with high accuracy. One option for avoiding this problem is - in analogy to the error estimate of numerical quadrature in case of an integrand oscillating around zero - to normalise δa with the sum
f b a b G μ a | x a x b | 2
(4)

of the absolute values of all pair-wise accelerations. In general f b a b , while in the outskirts of a stellar system f a G M / r 2 such that the scaled error δ a / f approaches the relative error δ a / a as desired. Conversely, in the centre f a (for a Plummer sphere, for example, f 2 G M / r s 2 as r 0 in the continuum limit) and δ a / f behaves sensibly if a 0 .

3.2 The acceleration errors of direct summation

In order to assess the errors currently tolerated in collisional N-body simulations, the GPU-based direct-summation library sapporo (Gaburov et al. [2009]) was applied to two sets of, respectively, N = 10 5 and N = 10 6 equal-mass particles, drawn randomly from a (Plummer [1911]) sphere (without any outer truncation). Figure 3 shows the resulting distributions of acceleration errors as compared to direct summation in double (64-bit) precision. As expected, the typical relative (or scaled) error is 10−7, comparable to the relative round-off error of single-precision floating-point arithmetic. However, there is a clear tail of large relative errors (middle panel). This is due to particles at small radii, whose acceleration is small, because the pair-wise forces with other particles mostly cancel out, while the (round-off) errors accumulate.
https://static-content.springer.com/image/art%3A10.1186%2Fs40668-014-0001-7/MediaObjects/40668_2014_Article_1_Fig3_HTML.jpg
Figure 3

Acceleration errors from the GPU. Distribution of acceleration errors δ a i for N = 10 5 (blue) and N = 10 6 (black) particles drawn from a Plummer sphere when using the state-of-the-art GPU-based direct-summation library sapporo (version 1.6) as compared to direct summation in double (64-bit) precision. The top, middle, and bottom panel refer to, respectively, the normalised (by the mean acceleration a ¯ ), relative, and scaled (by f defined in equation (4)) acceleration errors. The thin vertical lines indicate the rms error (dashed) as well as the median and the 99 and 99.9 percentiles (solid). Bins are 0.1 dex wide.

There is a significant increase in the error amplitude with particle number N: the errors for N = 10 6 are on average 10 larger than for N = 10 5 . This worrying property suggests that the fidelity of simulations using sapporo diminishes with N, implying that using this library with N 10 7 is not advisable.

From this exercise I conclude that in practice relative (or scaled) acceleration errors with an rms value of a few 10−7 and maximum 10 times larger are accepted in N-body simulations of collisional stellar dynamics.

4 Assessing the approximation errors

In order to optimise any implementation of FMM for high accuracy and low computational costs, a good understanding of and accurate estimates for the errors incurred by each individual FMM interaction are required. To this end, I now perform some numerical experiments.

I create a Plummer sphere of N = 10 6 particles and build an oct-tree. For each cell, the centre z ses of the smallest enclosing sphere for all its particles is found (see Section 5.1.1). I use z = s = z ses for each cell and pre-compute the cells’ multipole moments M n m ( z ) . Finally, the dual tree walk is performed using the multipole-acceptance criterion
θ < θ crit
(5)
with the opening angle
θ ( ρ z , A + ρ s , B ) / r , r | s B z A | .
(6)
Here, for each cell C
ρ z , C max sources a C { | x a z C | } and
(7)
ρ s , C max sinks b C { | x b s C | }
(8)

are (approximations for) the radii of the smallest spheres centred on z and s and containing all sources and sinks, respectively. In the experiments of this section ρ z = ρ s for each cell, because z = s and because all particles are source and sink simultaneously, but in general ρ z and ρ s may differ.

With the simple criterion (5) the multipole expansion is guaranteed to converge and have bounded errors.3 Cell → cell interactions with N A N B < p 3 , cell → particle interactions with N C < 4 p 2 , and particle → cell interactions with N C < p 2 are ignored, because direct summation is faster than FMM and will be preferred in a practical application. For the remaining well-separated interactions, the accelerations of all particles within the sink cell and due to all particles within the source cell are calculated in 64-bit precision using both FMM and direct summation. I then evaluate for each sink particle the acceleration error
δ a | a fmm a true |
(9)

with a true obtained by direct summation.

4.1 Cell-cell interactions

Cell-cell interactions involve the M2L kernel of the P 2 M + [ M 2 M ] + M 2 L + [ L 2 L ] + L 2 P chain of kernels. They are by far the most common and most important of all interactions encountered in the dual tree walk. For a random subset of cell-cell interactions generated by my experiments, the top panel of Figure 4 plots the maximum (over all particles within the sink cell) of δa normalised by the average acceleration M A / r 2 against θ, while the bottom panel plots the maximum relative force error δ a / a . As expected, the errors decrease with smaller θ and increasing p, though there is substantial scatter at any given θ and p. At θ 1 , the expansion order has little effect on the errors, implying that θ 1 is required for small errors.
https://static-content.springer.com/image/art%3A10.1186%2Fs40668-014-0001-7/MediaObjects/40668_2014_Article_1_Fig4_HTML.jpg
Figure 4

Errors of the M2L kernel. Each point in the left panels represents a single cell → cell interaction with expansion order p as indicated. The maximum of the relative (bottom) and absolute force error (top; normalised to the mean force M A / r 2 ) within the sink cell is plotted against the opening angle θ. The curves in the top panel correspond to the relation (10), while the dashed lines are the power laws θ p . The right panels show the distributions of the ratio of the maximum absolute (top) and relative (bottom) force error to either the simple estimates (11) (dashed, σ on the left) or the improved estimates (14) (solid, σ on the right). The reported probabilities for error underestimation refer to the improved estimates. Vertical scale is linear in the number of interactions.

4.1.1 Comparing with simple error estimates

The approximation error from a single FMM interaction with θ < 1 has the theoretical strict upper bound (Dehnen [2002])
δ a M A r 2 ( p + 1 ) θ p ( 1 θ ) 2 ,
(10)

which is plotted as thin curves in the top panel of Figure 4. Obviously, this upper bound is satisfied, but typically it is 10-100 times larger than the actual largest error.

Moreover, equation (10) predicts diverging errors for θ 1 , while the actual errors behave much nicer. This is presumably because diverging errors only occur for rare sink positions combined with extreme source distributions (such as all particles concentrated near one point at the edge of the source sphere), which are not realised in these experiments.

Figure 4 also shows as dashed lines the simple power laws θ p , which give closer, though not strict, bounds
δ a θ p M A / r 2 and δ a / a θ p
(11)

to the actual errors.

4.1.2 Better error estimates

The simple error estimates (11) are still quite inaccurate: the maximal error is often much smaller (see also the dashed histograms in the right panels of Figure 4). The offsets of θ p from the actual errors increase with p (see left panels of Figure 4). This effect vanishes if the same limit for N A N B is used for all p, suggesting that it is caused by smoother distributions for larger numbers N A of sources. Indeed, if I simply divide the estimates (11) by N A the scatter of the residuals is much reduced, but a systematic trend with p remains.

However, there is more information about the distribution of sources than merely their number: their multipole moments M n m for n p . In order to incorporate this information into an error estimate, I first compute for each cell the multipole power
P n 2 m = n n ( n m ) ! ( n + m ) ! | M n m ( z ) | 2 .
(12)
By design these (i) satisfy P n , A M A ρ z , A n for any distribution of sources; (ii) are invariant under rotation (of the coordinate system) and hence independent of the interaction direction; and (iii) provide an upper bound for the amplitude of the multipole: | M n m ( z ) | P n / n ! . Having computed P n for each source cell, one can evaluate
E A B 1 M A k = 0 p ( p k ) P k , A ρ s , B p k r p
(13)
with O ( p ) operations. Note that E A B θ p with equality only for P n , A = M A ρ A n . The new error estimates are then
δ a E ˜ A B M A r 2 and δ a a E ˜ A B
(14)
with
E ˜ A B = 8 max { ρ z , A , ρ s , B } ρ z , A + ρ s , B E A B .
(15)

In the right panels of Figure 4, these new error estimates are compared with the simple estimates (11) of the last subsection by displaying the distributions of the ratio of the actual maximum error to these estimates. The main difference between the two sets of estimators is their accuracy: there is much less scatter for the new (solid histograms) than for the old estimators (dashed). Consequently, there are hardly any interactions for which the force error is overestimated by more than a factor ten, while the simple estimators (11) overestimated the force error by more than that for many interactions, in particular at large p. Another remarkable property of the new error estimator is its consistency with respect to expansion order: there is no systematic drift with expansion order.

The number of underestimated force errors (abscissa >1 in the right panels of Figure 4) is small but there is a clear tail of underestimated absolute errors (top panel). As this is not present for the relative errors, it must be caused by the deviation of the acceleration from the mean M A / r 2 . Indeed, the maximum error is expected to occur on the side of the sink towards the source, where the acceleration is larger, about M A / ( r ρ s , B ) 2 . When accounting for this by simply replacing r in (14) with r ρ s , B , the tail of underestimated force errors is diminished, but the overall distributions widens and a tail of overestimated errors appears.

4.2 Particle-cell interactions

Just occasionally, the dual tree walk algorithm encounters particle-cell interactions. Most of them will be computed using direct summation, leaving only the few with populous cells for the FMM approximation.

For particle → cell and cell → particle interactions the FMM approximation uses the P2L and M2P kernels, respectively. Because these kernels correspond to the M2L kernel in the limits of ρ z , A 0 and ρ s , B 0 , respectively, all the algebra developed in the previous sub-section still applies.

4.2.1 Cell → particle interactions

Figure 5 is equivalent to Figure 4 for cell → particle interactions (which dominate in the tree code). The most notable difference to Figure 4 is the streaky nature of the relations in the left panels, implying a multi-modal distribution of errors at any given θ and p, as also evident from the dashed histograms in the right panels. The cause for this is simply that in an oct-tree cell size is quantised. In fact, the improved error estimates (14) account for this effect resulting in narrow mono-modal distributions of error offsets.
https://static-content.springer.com/image/art%3A10.1186%2Fs40668-014-0001-7/MediaObjects/40668_2014_Article_1_Fig5_HTML.jpg
Figure 5

Errors of the M2P kernel. As Figure 4 but for cell → particle interactions, see Section 4.2.1.

4.2.2 Particle → cell interactions

Figure 6 is equivalent to Figure 4 for particle → cell interactions. Clearly, at any given θ and p, the errors are larger than for any other type of interactions and are in fact approaching the theoretical limit (solid curves in the top left panel). What is more, not much can be done about this in terms of error estimates: since the source is just a particle without inner structure, the improved estimates (14) are simply a rescaling by a factor 8 from the simple power laws (a simple shift between the dashed and solid histograms in the right panels). They are nonetheless equally accurate as for the cell → cell interactions and suffer from a similar level of force underestimation (for a few percent of interactions and by less than a factor two).
https://static-content.springer.com/image/art%3A10.1186%2Fs40668-014-0001-7/MediaObjects/40668_2014_Article_1_Fig6_HTML.jpg
Figure 6

Errors of the P2L kernel. As Figure 4 but for particle → cell interactions, see Section 4.2.2.

5 Optimising the multipole-acceptance criterion

With the improved error estimates in hand, the practical implementation of FMM for high accuracy can finally be considered. The main questions arising in this context are:

What to pick for the expansion centres z and s?

When to consider two cells well-separated?

What expansion order p to use?

The possible answers to these questions affect both the computational cost and the approximation accuracy. Hence, for a given accuracy target, there exists an optimal choice for all these parameters, in the sense of minimal CPU time (and memory) consumption. This section deals with the algorithmic aspects of this problem, i.e. the choice for z and s and the functional form of the multipole-acceptance criterion. The tuning of the parameters (of the multipole-acceptance criterion as well as the expansion order) with the aim of minimal computational effort for a given accuracy is the subject of the next section.

Astonishingly, this issue of optimal choice for z and s and the multipole-acceptance criterion has not been much investigated. Instead, implementations of multipole methods often employ either of two simple strategies. The tree code generally uses a fixed order p and an expansion centred on the cells’ centres of mass, while two cells are considered well-separated if the simple geometric multipole-acceptance criterion (5) is satisfied, such that θ crit controls the accuracy.

With traditional FMM, on the other hand, the expansion centres z and s are both taken to be the geometric cell centres and two cells are deemed well-separated as soon as the expansion converges, corresponding to θ crit = 1 . When using hierarchical cubic grids (instead of an adaptive tree), this is implemented by interacting only between non-neighbouring cells on the same grid level whose parent cells are neighbours (e.g. Cheng et al. [1999]). The accuracy is then only controlled by the expansion order p.

5.1 Choice of expansion centres z and s

As far as I am aware, all existing FMM implementations use the same position for the multipole and potential expansion centres, i.e. z = s , for each cell. For traditional FMM, these are equal to the geometric cell centres. This has the benefit of a finite number of possible interaction directions r ˆ , in particular when θ crit = 1 , for which the coefficients Θ n m ( r ˆ ) could be pre-computed. However, the computation of these coefficients on the fly is often faster than a table look-up. Moreover, in view of Figure 4 θ crit = 1 appears ill-suited for high accuracy.

In fact, the restriction z = s reduces the freedom and hence the potential for optimising the method. Nonetheless, when aiming for low accuracy, choosing z = s = z com , the cells’ centres of mass, has some advantages. First, the dipoles vanish and the low-order multipoles tend to be near-minimal. Second, if using a mutual version of the algorithm (when the interactions A B and B A are done simultaneously), the computational costs are reduced and the approximated forces satisfy Newton’s third law exactly, i.e. F a b + F b a = 0 (Dehnen [2002]).

However, in practice there is no benefit from such an exact obedience of Newton’s law, as the total momentum is not exactly conserved, because of integration errors arising from the fact that the particles have individual time steps. Moreover, the degree of deviation from exact momentum conservation in such a case does not reflect the true accumulated force errors. In a more general method, the approximated forces will deviate from the ideal F a b + F b a = 0 by an amount comparable to their actual force errors and the non-conservation of total momentum is somewhat indicative of the accumulated effect of the force errors (see also Appendix B.3).

5.1.1 Choice of the potential expansion centre s

The results of Section 4, in particular the functional form of E A B in equation (13), suggest to choose the potential expansion centres s such that the resulting sink radii ρ s , and hence the estimated interaction errors, are minimal. Thus, s = z ses , the centre of the smallest enclosing sphere. Finding the smallest enclosing sphere for a set of n points has complexity O ( n ) . Doing this for every sink cell would incur a total cost of O ( N ln N ) and be prohibitively expensive.

Instead, I use an accurate approximation by finding for each cell the smallest sphere enclosing the spheres of its grand-daughter cells. This incurs a total cost of O ( N ) and is implemented via the Computational Geometry Algorithms Library (http://www.cgal.org, Fischer et al. [2013]), using an algorithm of Matoušek et al. ([1996]).

5.1.2 Choice of the multipole expansion centre z

As already mentioned above, setting z = z com has some virtue for low expansion orders p. However, for high expansion orders, the high-order multipoles become ever more important, suggesting that z = z ses may be a better choice. In order to assess the relative merits of these methods, I repeated the experiments of Section 4 for both methods and compared the resulting maximum absolute and relative force errors incurred for the same cell → cell interactions (for which the two methods give different θ).

I found that the errors for the two methods are very similar with an rms deviation of 0.15 dex, but a very small mean deviation. At p 8 there is a trend of more accurate forces for z = z com , while at p 8 smaller errors are obtained with z = z ses . This trend is simply a consequence of P k being smaller for z = z com than for z = z ses at low k and larger at high k. This together with the improved error estimates (14) also explains that (for an interaction A B ) z = z com tends to give more accurate forces if ρ z , A < ρ s , B , while z = z ses tends to be more accurate if ρ z , A > ρ s , B .

5.2 A simple FMM implementation

Let us first experiment with an implementation that uses the simple multipole-acceptance criterion (5) and a fixed expansion order p. This is the standard choice for the tree code and as such implemented in many gravity solvers used in astrophysics. The computational costs of such an implementation roughly scale as p α / θ crit 3 with α 2.3 , because the number of interactions increases as θ crit 3 for large N, while the cost for one is p 2.3 . Together with the simple error estimate (11), this means that if one aims each FMM interaction to satisfy δ a / a < ϵ , then the minimum cost for fixed ϵ occurs for
θ crit = e α / 3 0.46 .

Thus, the optimal opening angle is independent of p. The accuracy is then controlled by the expansion order, requiring p 16 for ϵ < 10 8 (according to Figure 4). The computational costs rise roughly like | ln ϵ | α with decreasing ϵ.

I applied the FMM method with z = z ses , expansion order p = 8 , and θ crit = 0.4 to N = 10 7 equal-mass particles drawn from a Plummer sphere. Figure 7 plots the resulting distributions of absolute (top), relative (middle), and scaled (bottom) acceleration errors. All three distributions are mono-modal, but very wide, much wider than those obtain from GPU-based direct summation (Figure 3). In particular, there are extended tails towards very large relative or scaled errors, containing only 1% of the particles but reaching up to 1000 times the median error. These tails are due to particles at large radii and, for the relative errors only, also at small radii (see the discussion in Section 3.1).
https://static-content.springer.com/image/art%3A10.1186%2Fs40668-014-0001-7/MediaObjects/40668_2014_Article_1_Fig7_HTML.jpg
Figure 7

Acceleration errors for naive FMM. Similar to Figure 3, but for N = 10 7 particles and accelerations obtained by FMM using expansion order p = 8 and multipole-acceptance criterion ρ z , A + ρ s , B < r θ crit (equation (5)) with θ crit = 0.4 . Bins are 0.01 dex wide.

There are two main effects responsible for these properties of the error distributions. First, errors from a single FMM interaction follow a distribution with variance of 1-2 dex. The maximum errors reported in Section 4 only occur for particles near the edges and corners of the sink cell, while most have smaller errors. Moreover, the force errors due to FMM interactions of the same sink cell with source cells in opposing directions tend to partially cancel rather than add up. Both explain why the median errors reported in Figure 7 are much smaller than the maximum relative error incurred by a single cell → cell interaction, which according to Figure 4 is 10−4.

More important is a second effect: the final force errors are not the sum of the relative errors of individual FMM interactions, which are controlled by the simple multipole-acceptance criterion, but of their absolute errors δa. Since, according to equation (11), δ a θ p M A / r 2 θ p + 2 M A / 4 ρ z , A 2 , the FMM interactions with cells of large surface density M / ρ z 2 dominate the error budget. In fact, the particles at very large radii have δ a / a δ a / f 10 4 , exactly as expected from a few FMM interactions with near maximal errors.

5.3 Towards better multipole-acceptance criteria

This discussion suggests that multipole-acceptance criteria which balance the absolute force errors of individual FMM interactions are preferable. When working with the simple estimators (11) or the error bound (10), this leads to critical opening angles which depend on the properties of the interacting cells, such as their mass or surface density.

Such an approach can indeed be made to work (Dehnen [2002]), but the aim here is to go beyond that and use the improved error estimates (14). This results in the multipole-acceptance criteria
θ < 1 E ˜ A B M A r 2 < ϵ min b B { a b } ,
(16a)
θ < 1 E ˜ A B M A r 2 < ϵ min b B { f b }
(16b)

with the aim to obtain δ a / a ϵ and δ a / f ϵ , respectively.

The black histograms in Figure 8 show the error distributions resulting from these criteria, when the values for a b and f b used in equation (16) have been taken from the direct-summation comparison run. The distributions for δ a / a in the left and δ a / f in both panels are remarkably narrow with a median error ϵ as targeted, a steep truncation towards large errors, and a maximum error 10 ϵ . The tail of large δ a / a in the right panel is due to particles at small radii, for which a f such that criterion (16b) allows large δ a / a .
https://static-content.springer.com/image/art%3A10.1186%2Fs40668-014-0001-7/MediaObjects/40668_2014_Article_1_Fig8_HTML.jpg
Figure 8

Acceleration errors for improved FMM. Same as Figure 7 but for the multipole-acceptance criterion (16a) with ϵ = 2 × 10 7 (left) or (16b) with ϵ = 10 7 (right). The values for a and f are either taken from the direct-summation run (black), or obtained by low-oder FMM (red, see Section 5.4.2). In all cases the computational effort is similar to that of the FMM run shown in Figure 7 (since a f criterion (16a) gives a tighter constraint than (16b) and hence requires larger ϵ for the same computational effort).

The difference between these error distributions and those shown in Figure 7 and resulting from the simple geometric multipole-acceptance criterion (5) is remarkable. While the median errors are comparable, the criteria (16) do not produce extended tails of large errors of the quantity controlled ( δ a / a in left and δ a / f in the right panels of Figure 8), and the maximum errors are more than 2 orders of magnitude smaller. What is more, the tails towards small errors have also been somewhat reduced, indicating that the improved criterion avoids overly accurate individual FMM interactions.

This improvement has been achieved without increasing the overall computational effort, but by carefully considering the error contribution from each approximated interaction.

5.4 Practical multipole-acceptance criteria

In a real application one has, of course, no a priori knowledge of a b or f b for any particle and must instead use something else in the multipole-acceptance criteria (16). In some situations, a suitable scale can be gleaned from the properties of the system modelled. For example, if simulating a star cluster of known mass profile M ( r ) and centre x 0 , one may simply use a b G M ( r b ) r b 2 with r b = | x b x 0 | . I now consider other options.

5.4.1 Using accelerations from the previous time step

Employing the accelerations a b from the previous time step in equation (16a) requires no extra computations. However, it means that the gravity solver is not self-contained, but requires some starter to get the initial accelerations.

Also, using information from the previous time step subtly introduces an artificial arrow of time into the simulation, because δ a new < ϵ a old implies δ a new / a new < ϵ a old / a new . Hence, a particle moving in a direction of increasing acceleration has, on average, smaller δ a / a than when moving in the opposite direction, or in reversed time. However, the time integration methods currently employed almost exclusively in N-body simulations of collisional stellar dynamics are irreversible and introduce their own arrow of time. This suggests, that the additional breach of time symmetry by the magnitude (not the direction) of the force error may not be a serious problem in practice.4

5.4.2 Estimating a b or f b using low-order FMM

As Section 4 has shown, the error estimate E ˜ A B used in the multipole-acceptance criteria (16) still has significant uncertainty, and using highly accurate values for a b or f b in equation (16) is unnecessary. Instead, rough estimates should suffice. Such estimates can be obtained via a low-order FMM. This amounts to running the FMM twice: once with a simple multipole-acceptance criterion to obtain rough estimates for a b or f b , and then again using the sophisticated criteria (16) employing the results of the first run.

The acceleration scale f (defined in equation (4)) is similar to the gravitational potential (1), except that its Greens function is | r | 2 . This implies that it too can be estimated using FMM, albeit not using an explicitly harmonic formulation.

I implemented both options, estimating a or f via FMM, using the lowest possible order ( p = 0 for f and p = 1 for gravity - recall that a = Ψ is approximated at one order lower than the potential Ψ) and multipole-acceptance criterion θ < 1 . To this end, I use s = z = z com and a mutual version of the dual tree walk. The resulting estimates for f or a = | a | have rms relative errors of 15%. The additional computational effort is still much smaller than that of the high-accuracy approximation of gravity itself, though estimating f is faster because it is a scalar rather than a vector and because no square-root needs to be calculated.

The distributions of acceleration errors resulting from using these estimates in equation (16) are shown in red in Figure 8. They are only very slightly worse than those in black, which have been obtained using the exact values of a b and f b in equation (16).

6 Optimising adaptive FMM

The previous section provided answers to the first two questions asked at its beginning, but not to the one after the optimal expansion order p. To answer this question I now report on some experiments, which also provide the actual computational costs for a given required force accuracy.

All experiments are run on a single compute node with 16 Intel Xeon E5-2670 CPUs, which support the AVX instruction set (see below), and using code generated by the gcc compiler (version 4.8.2).

6.1 Implementation details

The FMM relations of Section 2 and Appendix A (using the rotation-accelerated M2L kernel of Appendix A.6 when faster) have been implemented in computer code. The code employs a one-sided version of the dual tree walk, which considers the interactions A B and B A independently. The code is written in the C++ C++ programming language and has been tested using various compilers and hardware. The implementation employs vectorisation and shared-memory parallelism as outlined below.

6.1.1 Vectorisation

Most current CPUs support vector sizes of 16 (SSE), 32 (AVX), or 64 (MIC) bytes, allowing K = 2 , 4 , or  8 identical simultaneous double-precision floating-point operations (or twice as many in single precision). Because the FMM kernels do not (usually) relate adjacent elements, their efficient vectorisation is not straightforward (and well beyond compiler optimisation). I explicitly implement a method computing K M2L kernels simultaneously. To this end, the multipole moments of the K source cells are loaded into a properly aligned buffer (similar to transposing a matrix) before, and afterwards the K field tensors are added from their vector-buffer to the sink cells’ field tensors. Unfortunately, this loading and storing (which cannot be vectorised) reduces the speed-up obtained by the simultaneous kernel computations.

Conversely, direct summation is perfectly suitable for vectorisation and a speed-up of a factor K is achievable. The code prefers direct summation whenever this is deemed to be faster, based on a threshold for the number of particle-particle interactions ‘caught’ in a given cell-cell interaction.

6.1.2 Multi-threading

All parts of the implementation use multi-threading and benefit from multi-core architectures. This is done via hierarchical task-based parallelism implemented via threading building blocks (tbb, Reinders [2007]), an open source task parallel library with a work-stealing scheduler. The algorithms for multi-threaded tree building and dual tree walk are quite similar to those described by Taura et al. ([2012]) and I refrain from giving details here.

6.1.3 Precision and expansion order

This study reports only on one particular implementation aimed at high accuracy. It uses double precision (64 bits) floating-point arithmetic throughout, z = z ses , and expansion orders p 20 .

6.2 Wall-clock time versus accuracy

I applied my implementation with criteria (16a) and (16b) to N = 10 7 particles drawn from a Plummer sphere, and using low-order estimates for a b and f b in equation (16). I varied the expansion order p and the accuracy parameter ϵ and for each run plot in Figure 9 the total wall-clock time against the rms and the 99.99 percentile acceleration errors.
https://static-content.springer.com/image/art%3A10.1186%2Fs40668-014-0001-7/MediaObjects/40668_2014_Article_1_Fig9_HTML.jpg
Figure 9

Error-cost relation. Wall-clock time versus relative (top) and scaled (bottom) acceleration error for N = 10 7 particles drawn from a Plummer sphere. The top panel reports runs using multipole-acceptance criterion (16a) with a low-order-FMM estimate for a b , while the bottom panel reports runs using multipole-acceptance criterion (16b) with a low-order-FMM estimate for f b . Each pair of open and filled symbols (of same colour and ordinate) refers to another FMM run with expansion order p as indicated and a different value for parameter ϵ in equation (16). The timings include all phases of the computation, including tree building and low-order estimation of a b or f b - for comparison, the direct-summation calculation for obtaining the ‘true’ accelerations took 25k seconds on the same hardware. The thin dotted and dashed lines are power laws with exponents −0.16 and −0.2, respectively.

The rms error is always ten times smaller than the 99.99 percentile,5 implying the absence of extended large-error tails. For any fixed expansion order p, the relation between time and error can be approximated by a constant plus a power law that becomes flatter for larger p. At any given error, there is an optimal expansion order p in the sense of providing the fastest approximation. When using this optimal expansion order, the fastest FMM computation for a given error scales very nearly like a power law with exponent 0.18 . Thus when reducing the error by a factor ten, the computational costs rise only by a factor 1.5.

Constraining the relative error (top panel of Figure 9) is slightly more costly than constraining the scaled error (bottom panel). This is largely because f > a as discussed in the caption to Figure 8, but also because estimating f is easier and faster than estimating a. Of course, the estimation of a can be easily avoided in practice by using the accelerations from the previous time step.

6.3 Accuracy versus parameter ϵ

In any practical application there is, of course, no possibility to check on the actual error, so it is important to test how well it is reflected by the parameter ϵ. As can be seen from Figure 10, the rms value for the respective error ( δ a / a if using criterion (16a) and δ a / f if using criterion (16b)) is typically slightly less than ϵ for the optimal expansion order p. At intermediate values ( ϵ 10 8 ) the error is actually a factor 2 smaller. The 99.99 percentile of the errors is typically a factor ten larger.
https://static-content.springer.com/image/art%3A10.1186%2Fs40668-014-0001-7/MediaObjects/40668_2014_Article_1_Fig10_HTML.jpg
Figure 10

Error reliability. Rms value (squares) or 99.99 percentile (triangles) of the error δ a / a (top) or δ a / f (bottom) versus parameter ϵ for the same runs as in Figure 9 (using the same colour coding). Full symbols indicate that the expansion order is optimal, i.e. obtained minimal wall-clock time for the given error measure (lowest line in Figure 9).

6.4 Complexity: scaling with the number N of particles

The overall cost of my high-accuracy FMM implementation is dominated by the computation of all node-node interactions during the dual tree walk. All other phases (establishing the hierarchical tree structure, computing z, s, and M n m for each cell; passing down F n m and evaluating gravity for each sink position) contribute much less (see Table 2). When using a simple geometric multipole-acceptance criterion, such as equation (5), the FMM is well known to have complexity O ( N ) (e.g. Cheng et al. [1999]). This is because distant interactions contribute less than O ( N ) , so that the overall costs are dominated by the local interactions only (Dehnen [2002]).
Table 2

Timings and errors for FMM runs for different N

N

t tree

t ffmm

t up

t walk

t down

{ δ a / f } rms

{ δ a / f } 99.99 %

104

0.0004

0.0011

0.0012

0.0317

0.0005

2.81 × 10−7

1.32 × 10−6

105

0.0019

0.0042

0.0097

0.2131

0.0044

3.61 × 10−7

2.51 × 10−6

106

0.0290

0.0245

0.0957

1.5366

0.0431

3.85 × 10−7

3.32 × 10−6

107

0.2559

0.1897

0.8870

11.358

0.3999

4.05 × 10−7

2.20 × 10−6

The runs used p = 10 and ϵ = 10−6.25. The timings are given in seconds and refer to, respectively, the tree building; the estimation of f via low-order FMM; the passing up of z, s, min{f}, and M n m ; the dual tree walk; and the passing down of F n m and evaluation of gravity. See also Figure 11.

I am not aware of theoretical estimates for the complexity for the case of more sophisticated multipole-acceptance criteria, but Dehnen ([2002]) reports an empirical scaling proportional to N 0.93 for his approach of a mass-dependent opening angle. Table 2 and Figure 11 present the timings obtained with my implementation using p = 10 , ϵ = 10 6.25 , and low-order FMM estimates of f b in equation (16b). With these settings, the acceleration errors are comparable to those generated via the sapporo library on a GPU (the current state-of-the-art force solver for collisional N-body simulations), as reported in Section 3.2.
https://static-content.springer.com/image/art%3A10.1186%2Fs40668-014-0001-7/MediaObjects/40668_2014_Article_1_Fig11_HTML.jpg
Figure 11

Scaling of computational costs with N . Wall-clock time for the computation of the mutual gravitational forces between N particles drawn from a Plummer sphere. The FMM (full squares) is parameterised (see Table 2) to yield acceleration errors very similar to those of direct summation on GPUs using the sapporo library (open triangles, using a NVIDIA K20M GPU accelerator).6 The direct summation on 16 CPUs (open squares) uses double precision and besides the accelerations also computes the gravitational potential and the scale f (equation (4)).

From Table 2, it can be seen that the costs for tree building grow faster than linearly with N ( N ln N is expected), those for the upward and downward passes roughly linearly with N (as expected), but those for the FMM estimation of f and the dual tree walk less than linearly. As a result, the total computational costs are very well fit by the power law N 0.87 for N > 10 4 , see Figure 11.

Figure 11 also shows the timings for a (double-precision) direct-summation on the same hardware (yielding much more accurate accelerations) and for a mixed-precision direct-summation on a GPU using the sapporo library (yielding comparably accurate accelerations). At large (but realistic) N FMM out-performs direct summation, even if accelerated using a GPU.

6.5 Scaling with the number of CPUs

Figure 12 plots the strong scaling factor t 1 / n t n for my multi-threaded implementation. The scaling drops to 80% for 16 cores, which is not untypical for multi-threaded programs. This drop is presumably caused by imbalances at synchronisation points, of which the implementation has many. Most of these are not algorithmically required, but allow for a much easier implementation. Clearly, any massively parallel implementation needs to address this issue to retain good scaling for large numbers of processors.
https://static-content.springer.com/image/art%3A10.1186%2Fs40668-014-0001-7/MediaObjects/40668_2014_Article_1_Fig12_HTML.jpg
Figure 12

Strong scaling relation. Strong scaling factor for the computation of the mutual forces for N = 10 7 particles with p = 10 and ϵ = 10 6.25 plotted against the number of cores.

7 Beyond simple gravity approximation

So far, I have considered the approximate computation of the unsoftened gravitational potential and acceleration at all particle positions with equal relative (or scaled) accuracy. However, the fast multipole method can be easily modified or extended beyond that.

For example, one may want to have individual accuracy parameters ϵ b instead of a global one. This is easily accommodated by replacing ϵ min b B { a b } in criterion (16a) with min b B { ϵ b a b } and analogously for criterion (16b).

When using individual ϵ b , but also in general, it may be beneficial to adapt the expansion order p to the accuracy actually required for a given cell → cell interaction. This could be implemented by using the lowest p p max for which the multipole-acceptance criterion is satisfied.

7.1 Force computation for a subset of particles

Most N-body codes employ adaptive individual time steps for each particle. The standard technique is Makino’s ([1991]) block-step scheme, where the forces of all active particles are computed synchronously. Active are those particles with time step smaller than some threshold (which varies from one force computation to the next).

When using FMM in such a situation, only interactions with sink cells contain at least one active particle must be considered. If the fraction of active particles in such cells is small (but non-zero), FMM becomes much less efficient per force computation. Fortunately, however, active particles are typically spatially correlated (because the time steps of adjacent particles are similar), such that the fraction of active particles is either zero or large.

I performed some practical tests, where only particles within some distance from the origin of the system were considered active. Figure 13 plots the wall-clock time vs. the number N a of active particles for N = 10 7 . As expected the costs for preparation phase (tree building and upward pass) are largely independent of N a (the slight increase of the red curve at large N a is because s and ρ s are computed as part of the upward pass, but only for cells with active particles).
https://static-content.springer.com/image/art%3A10.1186%2Fs40668-014-0001-7/MediaObjects/40668_2014_Article_1_Fig13_HTML.jpg
Figure 13

Computational costs for a subset of sinks. Wall-clock time for the computation of gravity for the innermost N a of N = 10 7 particles (of a Plummer sphere), using the same parameters (p and ϵ) as in Figure 11.

The costs for the interaction and downward pass, on the other hand, decrease roughly like N a 0.87 for N a 10 4 . The net effect is that for N a / N 0.01 , the costs are almost completely dominated by the preparation phase, and hence independent of N a . The precise point of this transition depends on N and the FMM parameters. For smaller N and/or more accurate forces, the relative contribution of the tree walk phase increases and the transition occurs at smaller N a .

There is certainly some room for improvement by, e.g. using a smaller expansion order p than is optimal for N a = N and/or re-cycling the tree structure from the previous time step. Both measures reduce the costs of the preparation phase and increase that of the interaction phase (at given ϵ), but shall reduce the overall costs if N a N .

7.2 Softened gravity or far-field force

Gravitational softening amounts to replacing the Newtonian Greens function ψ = | r | 1 by Dehnen ([2001])
ψ ( r ) = h 1 φ ( | r | / h )
(17)
with softening length h and softening kernel φ ( q ) q 1 as q . This corresponds to replacing each source point by a smooth mass distribution with density μ b ϱ ( x x b ) , where
ϱ ( r ) = ( 4 π ) 1 2 ψ ( r ) .
(18)

This Greens function (17) is no longer harmonic and harmonic FMM cannot be used. One obvious option is to use the more general Cartesian FMM of Appendix A.1 (Dehnen [2002]). The computational costs of this approach grow faster with expansion order p, such that small approximation errors (requiring high p) become significantly more expensive. However, small approximation errors are hardly required in situations where gravitational softening is employed. Alternatively, if softening is restricted to a finite region, i.e. if ϱ ( r ) = 0 for | r | h , harmonic FMM can still be used to compute gravity from all sources at distances | r | h , while direct summation could be used for neighbours, sources at | r | < h . This approach is sensible only if the number of neighbours is sufficiently bounded (so that the cost incurred by the direction summation remains small). This is the case, in particular, if the number of neighbours is kept (nearly) constant by adapting the individual softening lengths h i in order to adapt the numerical resolution (Price and Monaghan [2007]).

In practice, this requires to carry with each cell the radius h z > ρ z of the smallest sphere centred on z which contains all softening spheres of its sources, and allow a FMM interaction A B only if | z A s B | > h z , A + ρ s , B .

The same technique can be used to restrict the FMM approximation to the far field for each particle, i.e. the force generated by all sources outside of a sphere of known radius h b around x b .

7.3 Jerk, snap, crackle, and pop

The jerk is the total time derivative of the acceleration
j = a ˙ = d d t Ψ x .
(19)
The simplest way to estimate this using FMM, is to not allow the expansion centres to have any velocity ( z ˙ = s ˙ = 0 ), such that differentiating the FMM relations (3) w.r.t. time gives
Ψ ˙ n m ( x b ) = k = 0 p n l = k k [ ϒ k l ( s B x b ) F ˙ n + k m + l ( s B ) Ψ ˙ n m ( x b ) = + ϒ ˙ k l ( s B x b , x ˙ b ) F n + k m + l ( s B ) ] + δ Ψ ˙ n m ,
(20a)
F ˙ n m ( s B ) = k = 0 p n l = k k M ˙ k l ( z A ) Θ n + k m + l ( s B z A ) ,
(20b)
M ˙ n m ( z A ) = a A μ a ϒ ˙ n m ( x a z A , x ˙ a ) ,
(20c)

and the jerk follows from j = ( { Ψ ˙ 1 1 } , { Ψ ˙ 1 1 } , Ψ ˙ 1 0 ) . Since z ˙ = s ˙ = 0 , the M2M and L2L kernels (equations (3d) and (3e)) work also for the time derivatives M ˙ n m and F ˙ n m of the multipoles and field tensors, respectively. The relations for the next order, the snap s = a ¨ , can be derived by differentiating yet again.

With each additional order (jerk, snap, crackle, pop, …), the computational cost of the combined M2L kernels is not more than the corresponding multiple of the ordinary M2L kernel (i.e. acceleration plus jerk are twice as costly as just acceleration). This is a direct consequence of not allowing cell-centre velocities hence preventing the terms depending on z or s in equation (3) to carry any time dependence. In contrast, the computational costs of the P2M and L2P kernels grows quadratically with the order of time derivative. This is not really a problem, since those kernels are only needed once per particle, while the M2L kernel is typically used 100 times more often.

7.4 The tidal field

FMM can also be used to approximate the Hessian
T b = Ψ ( x b )
(21)
of the potential, which is given by the components of Ψ 2 m via
T x x = 1 2 Ψ 2 0 + 1 2 { Ψ 2 2 } , T x y = 1 2 { Ψ 2 2 } , T x z = { Ψ 2 1 } , T y y = 1 2 Ψ 2 0 1 2 { Ψ 2 2 } , T y z = { Ψ 2 1 } , and T z z = Ψ 2 0
(22)
(in particular tr ( T ) = 0 as expected). Note, however, that the accuracy of this approximation is lower than that for the acceleration. T is of particular interest in collisionless N-body modelling, when
τ b η T b 1 / 4
(23)
with dimensionless parameter η 1 has been suggested as criterion for individual particle time steps (Dehnen and Read [2011]). The matrix norm of T may be directly computed from Ψ 2 m as
T b = 3 2 | Ψ 2 0 | 2 + 2 | Ψ 2 1 | 2 + 1 2 | Ψ 2 2 | 2 .
(24)

8 Discussion and conclusions

The fast multipole method (FMM) approximates the computation of the mutual forces between N particles. I have derived the relevant mathematical background, giving much simpler formulæthan the existing literature, for the case of unsoftened gravity, when the harmony of the Greens function allows significant reduction of the computational complexity.

Like the tree code, my FMM implementation uses a hierarchical tree of spatial cells. Unlike the tree code, FMM uses cell → cell interactions, which account for all interactions between sources in the first cell and sinks in the second. Almost all distant particle → particle interactions are ‘caught’ by fewer than O ( N ) cell → cell interactions, such that local interactions, requiring O ( N ) computations, dominate the overall workload (Dehnen [2002]). With the tree code, the situation is reversed: the distant interactions require O ( N ln N ) computations and dominate the overall work. This implies that FMM has the best complexity of all known force solvers. What is more, the predominance of local as opposed to distant interactions makes FMM ideally suited for applications on super-computers, where communications (required by distant interactions) are increasingly more costly than computations. However, FMM is inherently difficult to parallelise and this study considered only a multi-threaded implementation with a task-parallel dual tree walk (the core of FMM).

Most previous implementations of FMM considered simple choices for the cell’s multipole- and force-expansion centres and the multipole-acceptance criterion which decides whether a given cell → cell interaction shall be processed via the multipole expansion or be split into daughter interactions. Traditionally, a simple opening-angle based multipole-acceptance criterion has been used and cell centres equal to either the cell’s geometric centre or its centre of mass. These choices, which presumably were based on computational convenience and intuition, inevitably result in a wide distribution of individual relative force errors with extended tails reaching 1000 times the median.

The main goal of this study was avoid such extended tails of large force errors and to minimise the computational effort at a given force accuracy. The key for achieving this goal is a reasonably accurate estimate, based on the multipole power of the source cell and the size of the sink cell, for the actual force error incurred by individual cell → cell interactions. Based on the insight from this estimate, I set the cell’s force-expansion centres to (an approximation of) the centre of the smallest sphere enclosing all its particles, when the cell size and hence the error estimates are minimal. I also use the new estimates in the multipole-acceptance criterion, such that each cell → cell interaction is considered on the merit of the error it likely incurs. This results in very well behaved distributions of the relative force errors, provided an initial estimate for the forces is at hand. This can either be taken from the previous time step or obtained via low-accuracy FMM.

After these improvements, the method has only two free parameters: the expansion order p and a parameter ϵ for the relative force error. Experiments showed that the actual rms relative force error is typically somewhat less than ϵ, while for any given ϵ there is an optimum p at which the computational cost are minimal. For ϵ = 10 6.25 , for example, p = 10 is optimal and the accelerations errors are comparable to those of direct summation on a GPU (the current state-of-the-art method for collisional N-body simulations). With these parameter settings, the computational costs scale like N 0.87 for large N and the method out-performs any direct-summation implementation for N 10 5 . When computing only the forces for N a < N of N particles, the costs are roughly proportional to N a 0.87 for N a / N 0.01 , but become independent of N a below that (where the costs for tree building dominate). For large N, this is still significantly faster than direct summation.

An implementation of the FMM on a GPU accelerator should yield a further significant speed-up compared to my CPU-based implementation, though this is certainly a challenging task, given that FMM is algorithmically more complex than direct summation or a tree code (both of which have been successfully ported to the GPU). Presumably a somewhat lesser challenge is a massively parallel implementation of the method, which can be run on a super computer.

A practical application of FMM in an actual collisional N-body simulation would be very interesting. Since the force between close neighbours is always computed directly (in double precision) as explained earlier, close encounters can be treated essentially in the same fashion as with existing techniques. However, an unfortunate hindrance to an application of the presented techniques originates from the long marriage of existing collisional N-body techniques with direct summation. Methods, such as the Ahmad-Cohen neighbour scheme, to reduce the need for the costly far-field force summations are not necessary with FMM, and the existing N-body tools are not well suited for an immediate application of FMM.

Appendix 1: Derivation of the FMM relations

Here, the FMM relations given in Section 2 are derived and motivated. Differently from the main text, the multipole and force expansion centres, z and s, are not explicitly distinguished and instead z is used for either. The general case z s is a trivial generalisation.

A.1 Cartesian FMM

The distance vector x b x a between two particles residing in two well-separated cells A and B, respectively, can be decomposed into three components (see also Figure 14)
x b x a = r + r b r a
(25)
with r a x a z A , r b x b z B , and r z B z A . The Taylor expansion of the general Greens function ψ ( x b x a ) in r a and r b up to order p then reads using multi-index notation7
ψ ( x b x a ) = | n | = 0 p | m | = 0 p | n | ( 1 ) | m | n ! m ! r b n r a m n + m ψ ( r ) + R p .
(26)
This series converges (the remainder R p 0 ) as p , if | r a + r b | < | r | . Inserting (26) into the expression
Ψ A B ( x b ) = a A μ a ψ ( x b x a )
(27)
for the (negative) potential due to all source points in cell A and for any sink position x b in cell B, one obtains after re-arranging
Ψ A B ( x b ) = | n | = 0 p 1 n ! ( x b z B ) n F n ( z B ) + δ Ψ A B ,
(28a)
F n ( z B ) | m | = 0 p | n | M m ( z A ) D n + m ( z B z A ) ,
(28b)
M m ( z A ) a A μ a ( 1 ) m m ! ( x a z A ) m
(28c)
with the derivatives D n ( r ) n ψ ( r ) . The FMM algorithm essentially works these equations backwards: in a first step, the multipoles M m ( z ) are computed for each cell via (28c) and by utilising those of daughter cells via the shifting formula
M m ( z + x ) = n = 0 m x n n ! M m n ( z ) .
(28d)
Second, for each cell the field tensors F n ( z ) of all its interactions are computed via (28b) and added up. Finally, the field tensors are passed down the tree, utilising the shifting formula
F n ( z + x ) = | m | = 0 p | n | x m m ! F n + m ( z ) ,
(28e)
and the potential (and its derivative, the acceleration) is evaluated via (28a) at each sink position. Equations (28) are the basis of Cartesian FMM, such as implemented in Dehnen’s ([2000], [2002]) falcON algorithm.
https://static-content.springer.com/image/art%3A10.1186%2Fs40668-014-0001-7/MediaObjects/40668_2014_Article_1_Fig14_HTML.jpg
Figure 14

Cell-cell interaction. The Greens function for the interaction between particles a and b at positions x a and x b and residing in cells A and B, is approximated by Taylor expanding the Greens function about r, the distance vector between the cell centres z A and z B .

At each order n = | n | , there are ( n + 2 2 ) coefficients F n (as well as M n and D n ), and the total number of coefficients up to order p is ( p + 3 3 ) . The computational effort of the resulting algorithm is dominated by their computation in (28b), which requires about ( p + 6 6 ) multiplications. Thus at large p a straightforward application of this method approaches an operation count of O ( p 6 ) . The computation (28b) of the field tensors is essentially a convolution in index space and hence can be accelerated using a fast Fourier technique with costs O ( p 3 ln p ) (but see endnote b).

A.2 Harmonic tensors

For the important case ψ = | r | 1 corresponding to gravitational and electrostatic forces, the above method can be improved by exploiting that this Greens function is harmonic, i.e. 2 ψ = 0 for | r | > 0 . As a consequence, the D n = n ψ are harmonic too and satisfy
2 D k = D k + ( 2 , 0 , 0 ) + D k + ( 0 , 2 , 0 ) + D k + ( 0 , 0 , 2 ) = 0 .
(29)
In other words: D n is traceless. At given degree n = k + 2 , equation (29) gives ( n 2 ) constraints such that of the ( n + 2 2 ) terms only 2 n + 1 are truly independent. In inner products, a traceless tensor only ‘sees’ the traceless part of its co-operand:
| n | = n A ¯ n B n = | n | = n A ¯ n B ¯ n = | n | = n A n B ¯ n ,
(30)
where the ‘reduced’ tensor A ¯ n denotes the traceless part of A n . Furthermore, r n ¯ is related to D n via
D n ( r ) = ( 1 ) n ( 2 n 1 ) ! ! r n ¯ r 2 n + 1 .
(31)
With these relations, the Taylor series of the harmonic Greens function becomes, for r > x
1 | r x | = n = 0 x n r n + 1 | n | = n ( 2 n 1 ) ! ! n ! x ˆ n ¯ r ˆ n ¯ ,
(32)
which is the Cartesian equivalent to the spherical harmonic expansion
1 | r x | = n = 0 x n r n + 1 m = n n Y n m ( x ˆ ) Y n m ( r ˆ )
(33)

(see equation (42) for a definition of Y n m ). While at each order n there are only 2 n + 1 truly independent terms, the expansion (32) still carries all ( n + 2 2 ) terms, amounting to a total of ( p + 3 3 ) terms in an expansion up to order p. The equivalent spherical harmonic expansion (33) only carries 2 n + 1 terms per order8 amounting to a total of ( p + 1 ) 2 , i.e. at large p is much preferable.

The number of terms actually used can be reduced to ( 2 n + 1 ) per order, for example, by omitting all terms with n z > 1 and recover their contribution via recursive application of
D k + ( 0 , 0 , 2 ) = D k + ( 2 , 0 , 0 ) D k + ( 0 , 2 , 0 )
(34)

(Applequist [1989]; Hinsen and Felderhof [1992]). However, the resulting algebraic challenges are considerable, though the overall computational effort could well be reduced to O ( p 3 ) operations (Joachim Stadel, private communication), but I am not aware of a systematic demonstration.

A.3 Spherical harmonics

The algebraic complications with obtaining an efficient Cartesian FMM stem from the fact that the Laplace operator involves three terms, such that the resulting recovery relation (34) has two terms instead of one on the right-hand side. This problem can be avoided by Taylor expanding in other than Cartesian coordinates where the Laplace operator involves only two instead of three terms.

The simplest possibility is a linear combination of Cartesian coordinates with complex coefficients. The standard FMM relations emerge from replacing x and y with
ξ 1 2 ( x + i y ) and η 1 2 ( x i y ) = ξ ,
(35)
while keeping z. Then ξ = x i y and η = x i y , such that x 2 + y 2 = ξ η and hence for harmonic functions
ξ η = z 2 ,
(36)

or D k + ( 0 , 0 , 2 ) = D k + ( 1 , 1 , 0 ) in place of equation (34). With this relation one can eliminate all mixed ξ-η derivatives in favour of z derivatives. This in turn allows a reduction in the number of indices from three to two by using the total number n of derivatives and the number | m | of ξ (for m < 0 ) or η derivatives (for m > 0 ).

Somewhat surprisingly, the relations required for FMM are hardly covered by the rich literature on spherical harmonics (and FMM). To derive the relevant formulæ, I follow the ideas of Maxwell ([1892], see also James [1969]) and define the differential operator
Δ n m { ( z ) n | m | ξ | m | , n m < 0 , ( z ) n | m | η | m | , 0 m n , 0 , | m | > n .
(37)
When applied to harmonic functions, this operator satisfies
Δ n m Δ k l = Δ n + k l + m ,
(38)
which can be shown via equation (36) and is inevitably linked to
Δ n m = ( 1 ) m Δ n m .
(39)
Since ψ = | r | 1 is harmonic, its derivatives
Θ n m ( r ) Δ n m | r | 1
(40)
are harmonic too. Moreover, the functions Θ n m ( r ) are homogeneous of degree ( n + 1 ) , i.e. Θ n m ( α r ) = α ( n + 1 ) Θ n m ( r ) . I also define the solid spherical harmonic of degree n as
ϒ n m ( r ) r 1 Θ n m ( r / r 2 ) ( n m ) ! ( n + m ) ! = r 2 n + 1 Θ n m ( r ) ( n m ) ! ( n + m ) ! .
(41)
That ϒ n m is harmonic follows from the fact that if f ( r ) is harmonic, then so is r 1 f ( r / r 2 ) (Hobson [1931]) (try this with your undergraduate students). Note that ϒ n m ( r ) is just a homogeneous polynomial of total degree n in x, y and z. These harmonics are related to the usual normalised surface spherical harmonic
Y n m ( r ˆ ) ( 1 ) m ( n m ) ! ( n + m ) ! P n m ( cos θ ) e i m ϕ
(42)
via
Θ n m ( r ) = [ ( n m ) ! ( n + m ) ! ] 1 / 2 r n 1 Y n m ( r ˆ ) ,
(43a)
ϒ n m ( r ) = [ ( n m ) ! ( n + m ) ! ] 1 / 2 r n Y n m ( r ˆ ) .
(43b)
Table 3 gives the first few harmonics in terms of x, y, z.
Table 3

The real-valued functions ( n m ) ! ( n + m ) ! U n m ( r ) = r 2 n + 1 T n m ( r ) for n 6

m n

0

1

2

3

4

5

6

6

      

10395 ( x 6 15 x 4 y 2 + 15 x 2 y 4 y 6 )

5

     

945 x ( x 4 10 x 2 y 2 + 5 y 4 )

10395 x z ( x 4 10 x 2 y 2 + 5 y 4 )

4

    

105 ( x 4 6 x 2 y 2 + y 4 )

945 z ( x 4 6 x 2 y 2 + y 4 )

945 ( x 4 6 x 2 y 2 + y 4 ) ( 11 z 2 r 2 )

3

   

15 x ( x 2 3 y 2 )

105 x z ( x 2 3 y 2 )

105 x ( x 2 3 y 2 ) ( 9 z 2 r 2 )

945 z x ( x 2 3 y 2 ) ( 11 z 2 3 r 2 )

2

  

3 ( x 2 y 2 )

15 z ( x 2 y 2 )

15 ( x 2 y 2 ) ( 7 z 2 r 2 )

315 z ( x 2 y 2 ) ( 3 z 2 r 2 )

315 ( x 2 y 2 ) ( 33 z 4 18 z 2 r 2 + r 4 )

1

 

x

3xz

3 x ( 5 z 2 r 2 )

15 x z ( 7 z 2 3 r 2 )

45 x ( 21 z 4 14 z 2 r 2 + r 4 )

315 x z ( 33 z 4 30 z 2 r 2 + 5 r 4 )

0

1

z

3 z 2 r 2

3 z ( 5 z 2 3 r 2 )

3 ( 35 z 4 30 z 2 r 2 + 3 r 4 )

15 z ( 63 z 4 70 z 2 r 2 + 15 r 4 )

45 ( 231 z 6 315 z 4 r 2 + 105 z 2 r 4 5 r 6 )

−1

 

y

3yz

3 y ( 5 z 2 r 2 )

15 y z ( 7 z 2 3 r 2 )

45 y ( 21 z 4 14 z 2 r 2 + r 4 )

315 y z ( 33 z 4 30 z 2 r 2 + 5 r 4 )

−2

  

6xy

30xyz

30 x y ( 7 z 2 r 2 )

630 x y z ( 3 z 2 r 2 )

630 x y ( 33 z 4 18 z 2 r 2 + r 4 )

−3

   

15 y ( 3 x 2 y 2 )

105 y z ( 3 x 2 y 2 )

105 y ( 3 x 2 y 2 ) ( 9 z 2 r 2 )

945 z y ( 3 x 2 y 2 ) ( 11 z 2 3 r 2 )

−4

    

420 x y ( x 2 y 2 )

3780 x y z ( x 2 y 2 )

3780 x y ( x 2 y 2 ) ( 11 z 2 r 2 )

−5

     

945 y ( 5 x 4 10 x 2 y 2 + y 4 )

10395 y z ( 5 x 4 10 x 2 y 2 + y 4 )

−6

      

20790 x y ( 3 x 2 y 2 ) ( x 2 3 y 2 )

See equations (58) for the relations to ϒ n m ( r ) and Θ n m ( r ) .

A.4 Spherical-harmonic FMM

In order to derive the relations for spherical-harmonic FMM, one must obtain the equivalent to the Cartesian Taylor expansion (26) and shift operations (28d), (28e). Via induction one can show that when applied to harmonic functions
1 n ! ( x ) n = m = n n ϒ n m ( x ) Δ n m = m = n n ϒ n m ( x ) Δ n m ,
(44)
which gives the translation operator for harmonic functions
exp ( x ) = n = 0 m = n n ϒ n m ( x ) Δ n m .
(45)
When applying this to the harmonic Greens function, one gets
1 | r x | = n = 0 m = n n ϒ n m ( x ) Θ n m ( r ) ,
(46)
which, because of equations (43), is equivalent to the standard form (33) and converges for r > x . Translating once again and employing (38) yields
1 | r x y | = k = 0 l = k k n = 0 m = n n ϒ n m ( x ) ϒ k l ( y ) Θ n + k m + l ( r ) ,
(47)
which converges for r > | x + y | . Comparing (46) and (47) one finds immediately the translation formula
ϒ n m ( x + y ) = k = 0 n l = k k ϒ k l ( x ) ϒ n k m l ( y ) .
(48)
When applying the translation operator (45) to Θ n m , one gets
Θ n m ( x + y ) = k = 0 l = k k ϒ k l ( y ) Θ n + k m + l ( x ) .
(49)

As the Cartesian FMM relations (28) were based on equation (26), the spherical harmonic FMM relations (3) are based on equation (47), which for ψ = | r | 1 is completely equivalent but computationally more efficient.

A.5 Implementation details

A.5.1 Recursive evaluation of spherical harmonics

One may also obtain the relations
Δ k l Θ n m ( x ) = Θ n + k m + l ( x ) ,
(50)
Δ k l ϒ n m ( x ) = ( 1 ) k + l ϒ n k m + l ( x ) .
(51)
The first one follows immediately from equations (38) and (40), while the second can be deduced by equating (48) to ϒ n m ( x + y ) obtained by applying the translation operator (45). From these two relations combined with the operator relation (38) and the definitions (40) and (41), one can obtain numerous recurrence relations. For example (omitting the arguments for brevity),
r 2 Θ n m = ( 2 n 1 ) z Θ n 1 m ( [ n 1 ] 2 m 2 ) Θ n 2 m ,
(52)
( n 2 m 2 ) ϒ n m = ( 2 n 1 ) z ϒ n 1 m r 2 ϒ n 2 m ,
(53)
which are equivalent to the recurrence relation (Gradshteyn and Ryzhik [1994], Eq. 8.733.2) for associated Legendre functions and, together with
Θ n n = ( 2 n 1 ) x + i y r 2 Θ n 1 n 1 and ϒ n n = x + i y 2 n ϒ n 1 n 1
(54)

as well as their counterparts for m = n , allow for an efficient and stable evaluation of Θ n m ( r ) and ϒ n m ( r ) .

Differentiating these relations with respect to time, one obtains recursion relations for the time derivatives of the harmonic functions. For example,
( n 2 m 2 ) ϒ ˙ n m = ( 2 n 1 ) [ z ˙ ϒ n 1 m + z ϒ ˙ n 1 m ] 2 r r ˙ ϒ n 2 m r 2 ϒ ˙ n 2 m .
(55)
Alternatively, from equations (50) and (51) one may also directly derive
Θ ˙ n m = ξ ˙ Θ n + 1 m + 1 z ˙ Θ n + 1 m + η ˙ Θ n + 1 m 1 and
(56)
ϒ ˙ n m = ξ ˙ ϒ n 1 m + 1 + z ˙ ϒ n 1 m + η ˙ ϒ n 1 m 1 .
(57)

A.5.2 Real-valued spherical harmonics

Because of the anti-symmetry relation (39), the complex spherical harmonics defined above are redundant: there are only 2 n + 1 independent (real) harmonics per order, in agreement with the counting in Section A.1. Hence, for any practical application one needs an appropriately reduced set of 2 n + 1 real-valued independent spherical harmonics per order. The simplest option is to consider real and imaginary parts of the complex-valued harmonics with m 0 :
U n m { ( ϒ n | m | ) = 1 2 i ( ϒ n m ϒ n m ) , m < 0 , ( ϒ n | m | ) = 1 2 ( ϒ n m + ϒ n m ) , m 0 ;
(58a)
and
T n m { ( Θ n | m | ) = 1 2 i ( Θ n m Θ n m ) , m < 0 , ( Θ n | m | ) = 1 2 ( Θ n m + Θ n m ) , m 0 .
(58b)

The relevant relations for these real-valued spherical harmonics are best directly transcribed from the corresponding complex relations.

A.6 Accelerating FMM relations

The FMM kernels M2L, M2M, and L2L (equations (3b), (3d), (3e)) all require O ( p 4 ) operations. However, if the interactions or translations are along the z-axis, the costs are only O ( p 3 ) because ϒ n m ( z ˆ ) = δ m 0 / n ! .

One method to exploit this is to first translate along the z-axis and then perpendicular to the z-axis. For a vector r perpendicular to the z-axis, ϒ n m ( r ) vanishes whenever n + m is even. This implies that a translation along r can be done faster than a general translation (in the limit of p , twice as fast).

This splitting method cannot be applied to the M2L kernel (3b) (because it is not a translation), which occurs many more times in the FMM algorithm than the M2M and L2L kernels. To accelerate the M2L kernel, one can exploit that a rotation only costs O ( p 3 ) operations, too. Thus, if one first rotates into a frame in which the interaction is along the z-axis, applies the M2L kernel in the rotated frame, and finally rotates back into the original frame, the total costs are still O ( p 3 ) .

A.6.1 Fast rotations

Since the spherical harmonics are homogeneous, a rotation (as opposed to a translation) does not mix between different orders n, and consequently the operation count is O ( p 3 ) . Thus, a general rotation is of the form
Y n m ( r ˜ ) = l = n n Γ n m l Y n l ( r ) ,
(59)
where r ˜ denotes the vector r in the rotated frame. Unfortunately, the matrices Γ n , also known as Wigner functions, are generally dense and non-trivial functions of the Euler angles. However, a rotation by angle α around the z-axis is simple:
Y n m ( r ˜ ) = e i m α Y n m ( r )
(60)
with an operation count of only O ( p 2 ) . With this one can build a general rotation by first rotating around the z-axis, then swapping z and x, rotating again about the z-axis (the x-axis of the original frame), swapping z and x again, and performing a final rotation around the z-axis. Like rotations, swapping coordinate axes does not mix between different orders n and can be represented as
Θ n m ( r ˜ ) = l = n n B n m l Θ n l ( r ) ,
(61)
where now r ˜ denotes the vector r in the frame obtained by swapping two Cartesian coordinates. The important difference between equations (59) and (61) is that the matrices B n are constants. Recursive relations for these swap matrices can be derived via the operator algebra of Section A.3. For example, for swapping x and z, one finds
2 Δ ˜ 1 0 = Δ 1 1 Δ 1 1 and 2 Δ ˜ 1 ± 1 = Δ 1 1 + Δ 1 1 ± 2 Δ 1 0
(62)
with which one can derive the recurrence relations
2 B n + 1 m l = B n m l 1 B n m l + 1 , 2 B n + 1 m ± 1 l = B n m l 1 + B n m l + 1 ± 2 B n m l ,
(63)
where it is understood that B n m l = 0 for | l | > n . A similar exercise for swapping y and z reveals that the swap matrices are given by i m l B n m l , while the corresponding swap matrices for ϒ n m are given by the transpose (because these matrices are orthonormal and the product (46) is invariant under coordinate swapping). Whereas the matrices B n are dense, the corresponding matrices for the real-valued harmonics (equations (58)) are not (Pinchon and Hoggan [2007]). For example, the matrices for swapping x and z for Θ 4 m and T 4 m are (omitting zero entries)
1 16 × [ 1 8 28 56 70 56 28 8 1 1 6 14 14 14 14 6 1 1 4 4 4 10 4 4 4 1 1 2 2 6 6 2 2 1 1 4 6 4 1 1 2 2 6 6 2 2 1 1 4 4 4 10 4 4 4 1 1 6 14 14 14 14 6 1 1 8 28 56 70 56 28 8 1 ]
(64)
and
1 8 × [ 8 56 1 14 4 4 1 2 3 4 1 6 2 5 4 1 14 6 35 28 1 ] ,
(65)

respectively. Thus, this method of achieving a general rotation not only avoids the (recursive) computation of the Wigner functions Γ n (which itself costs O ( p 3 ) operations), but also benefits from the facts that the swap matrices B n have ≈4 times fewer non-zero entries than the Γ n and are known a priori, such that they can be ‘hard-wired’ into computer code.

A.6.2 A fast M2L kernel

With these preliminaries, one can finally put together an accelerated O ( p 3 ) version for performing the M2L kernel (3b). Let ( x , y , z ) = r , then one first rotates the multipoles M k l (around the z-axis) by angle α z = arctan ( y / x ) , swaps x and z, rotates by α x = arctan x 2 + y 2 / z , and swaps x and z back. The obtained M ˜ k l has z-axis aligned with the interaction direction, and the M2L kernel can be performed via
F ˜ n m ( z B ) = k = | m | p n ( 1 ) m M ˜ k m ( z A ) ( n + k ) ! r n + k + 1 .
(66)

Finally, one must rotate F ˜ n m back to the original frame by first swapping x and z, rotating by α x , swapping x and z again, followed by a final rotation by α z .

These rotations and swaps can be accelerated further by exploiting that in (66) only multipoles M ˜ n m with | m | min { n , p n } are needed and, similarly, that F ˜ n m = 0 for | m | > min { n , p n } . As Figure 1 demonstrates, the overhead due to the rotations pays off already for p = 5 .

Appendix 2: The energy error of a simulation

The gravitational forces (and potentials) used in N-body simulations always carry some error. When using direct summation, this is solely due to round-off errors, while for approximate methods the approximation error should dominate round-off. Here, I investigate the consequences of these errors for the non-conservation of the total energy.

B.1 The energy error due to force errors

Consider, the energy error generated by acceleration errors δ a b after one time step τ,
δ E tot = τ b μ b x ˙ b δ a b .
(67)
Because the δ a b are not correlated with the velocities x ˙ b , their dot products largely cancel and δ E tot will be small. In order to estimate its amplitude, let us assume τ = η σ / a ¯ with η 1 , velocity dispersion σ, and typical acceleration a ¯ . If further assuming virial equilibrium and a relative acceleration error ε,
| δ E tot | / | E tot | η ε / N .
(68)
Over time this accumulates in the fashion of a random walk and after one dynamical time or η 1 time steps
| δ E tot | / | E tot | ε η / N .
(69)

Thus, the relative energy error resulting from the force errors alone is much smaller than ε, simply because it is some average over many force errors.

B.2 The measurement error

In order to measure the total energy, one must also calculate the individual particle potentials Ψ b (which are otherwise not required for the simulation). Assuming that the Ψ b are computed with relative error ε, the resulting error for the total energy is
| δ E tot | / | E tot | 2 ε / N .
(70)

If the same precision ε is used for computing the particle potentials and accelerations, this is much larger than the energy error (69) due to force errors.

B.3 Approximate gravity solvers

The situation is different for approximative methods, such as the tree code, FMM, and mesh-based techniques. All of these approximate the true potential, but use the exact derivatives of the approximated potential for the accelerations. Therefore, the total approximated energy should be conserved (modulo round-off errors), even if the approximation is poor.

For the FMM and the tree code the situation is actually different, because the approximated potential is not globally continuous but only piece-wise. This is because the concrete form of the approximation used for a given particle depends on its position (which determines how FMM approximates each pair-wise force). A particle crossing a boundary between such continuous regions suffers a jump in the (approximated) potential, and hence energy, while the corresponding kick in velocity (to conserve energy) is ignored. These discontinuities are part of the approximation error and their amplitudes proportional. The implication is that for the tree code and FMM energy is not conserved (even for accurate time integration) and the degree of non-conservation actually reflects the amplitude of the approximation errors in an average sense.

Footnotes
1

Cheng et al.’s ([1999]) expressions are quite cumbersome because they are given in terms of the surface spherical harmonics Y n m in polar coordinates and because they contain phase-factors like i | m | m owing to their unconventional definition for the Y n m which implies Y n m = Y n m instead of Y n m = ( 1 ) m Y n m .

 
2

Expressions like O ( p n ) for the operation count relate to the asymptotic behaviour at large expansion orders p. While this is straightforward to specify, it is not necessarily very relevant, since in the range up to p 10 , as required in practice, the actual costs usually grow more slowly than implied by the asymptotic behaviour (see Figure 1 for a typical example) and because the numerical implementation may be data-dominated rather than computation dominated.

 
3

The original definition used in the tree code of Barnes and Hut ([1986]) did not ensure bounded errors, causing the infamous ‘exploding galaxies’ bug first reported by Salmon and Warren ([1994]).

 
4

The situation is different for N-body simulations of collisionless stellar dynamics, where reversible integrators are used and the accepted force errors, and thus their time asymmetries, are significantly larger.

 
5

The increase of this ratio to ≈20 towards small errors may well be caused by inaccuracies of the direct summation used for calculating the errors.

 
6

The timings for the sapporo library also include additional computations (nearest neighbour finding and neighbour listing). These contribute negligibly at large N, but at small N they are, together with latency on the GPU, responsible for the deviation of the observed complexity from N 2 .

 
7

Using multi-index notation n ( n x , n y , n z ) with n | n | n x + n y + n z , such that the first sum in (26) is over non-negative integer triples n with n x + n y + n z p . Furthermore n ! n x ! n y ! n z ! and r n r x n x r y n y r z n z .

 
8

In equation (33), the Y l m are complex-valued for m 0 , but because of their symmetry Y l m = ( 1 ) m Y l m there are only 2 n + 1 independent real-valued components per order n.

 

Declarations

Acknowledgements

The author thanks Joachim Stadel for many helpful discussions and the suggestion to allow z s , Alessia Gualandris for running sapporo to provide the data for Figure 3, and Simon Portegies Zwart and Jeroen Bédorf for providing the timings for sapporo 2 in Figure 11. This work was supported by STFC consolidated grant ST/K001000/1.

Authors’ Affiliations

(1)
Department for Physics & Astronomy, University of Leicester

References

  1. Ahmad A, Cohen L: A numerical integration scheme for the N -body gravitational problem. J. Comput. Phys. 1973, 12: 389–402. 10.1016/0021-9991(73)90160-5ADSView ArticleGoogle Scholar
  2. Applequist J: Traceless Cartesian tensor forms for spherical harmonic functions: new theorems and applications to electrostatics of dielectric media. J. Phys. A, Math. Gen. 1989, 22: 4303–4330. 10.1088/0305-4470/22/20/011MathSciNetADSView ArticleGoogle Scholar
  3. Barnes J, Hut P:A hierarchical O(N log N) force-calculation algorithm. Nature 1986, 324: 446–449. 10.1038/324446a0ADSView ArticleGoogle Scholar
  4. Capuzzo-Dolcetta R, Miocchi P: A comparison between the fast multipole algorithm and the tree-code to evaluate gravitational forces in 3-D. J. Comput. Phys. 1998, 143: 29–48. 10.1006/jcph.1998.5949MathSciNetADSView ArticleGoogle Scholar
  5. Cheng H, Greengard L, Rokhlin V: A fast adaptive multipole algorithm in three dimensions. J. Comput. Phys. 1999, 155: 468–498. 10.1006/jcph.1999.6355MathSciNetADSView ArticleGoogle Scholar
  6. Dehnen W: A very fast and momentum-conserving tree code. Astrophys. J. 2000, 536: L39-L42. 10.1086/312724ADSView ArticleGoogle Scholar
  7. Dehnen W: Towards optimal softening in three-dimensional N -body codes - I. Minimizing the force error. Mon. Not. R. Astron. Soc. 2001, 324: 273–291. 10.1046/j.1365-8711.2001.04237.xADSView ArticleGoogle Scholar
  8. Dehnen W:A hierarchical O(N log N) force calculation algorithm. J. Comput. Phys. 2002, 179: 27–42. 10.1006/jcph.2002.7026MathSciNetADSView ArticleGoogle Scholar
  9. Dehnen W, Read JI: N -Body simulations of gravitational dynamics. Eur. Phys. J. Plus 2011., 126: Article ID 55 10.1140/epjp/i2011-11055-3Google Scholar
  10. Fischer, K, Gärtner, B, Herrmann, T, Hoffmann, M, Schönherr, S: Bounding volumes. In: CGAL User and Reference Manual, 4.2 edn., CGAL Editorial Board (2013). http://www.cgal.org/Manual/4.2, Fischer, K, Gärtner, B, Herrmann, T, Hoffmann, M, Schönherr, S: Bounding volumes. In: CGAL User and Reference Manual, 4.2 edn., CGAL Editorial Board (2013). http://www.cgal.org/Manual/4.2
  11. Gaburov E, Harfst S, Portegies Zwart S: SAPPORO: a way to turn your graphics cards into a GRAPE-6. New Astron. 2009,14(7):630–637. 10.1016/j.newast.2009.03.002ADSView ArticleGoogle Scholar
  12. Gradshteyn IS, Ryzhik I: Table of Integrals, Series, and Products. 5th edition. Academic Press, London; 1994.Google Scholar
  13. Greengard L, Rokhlin V: A fast algorithm for particle simulations. J. Comput. Phys. 1987, 73: 325–348. 10.1016/0021-9991(87)90140-9MathSciNetADSView ArticleGoogle Scholar
  14. Hinsen K, Felderhof BU: Reduced description of electric multipole potential in Cartesian coordinates. J. Math. Phys. 1992, 33: 3731–3735. 10.1063/1.529869MathSciNetADSView ArticleGoogle Scholar
  15. Hobson EW: The Theory of Spherical and Ellipsoidal Harmonics. Cambridge University Press, Cambridge; 1931.Google Scholar
  16. James RW: Transformation of spherical harmonics under change of reference frame. Geophys. J. Int. 1969, 17: 305–316. 10.1111/j.1365-246X.1969.tb00239.xADSView ArticleGoogle Scholar
  17. Makino J: Optimal order and time-step criterion for Aarseth-type N -body integrators. Astrophys. J. 1991, 369: 200–212. 10.1086/169751MathSciNetADSView ArticleGoogle Scholar
  18. Makino J, Taiji M: Scientific Simulations with Special-Purpose Computers: The GRAPE Systems. Wiley, New York; 1998.Google Scholar
  19. Matoušek J, Sharir M, Welzl E: A subexponential bound for linear programming. Algorithmica 1996, 16: 498–516. 10.1007/BF01940877MathSciNetView ArticleGoogle Scholar
  20. Maxwell JC: Treatise on Electricity and Magnetism. Oxford University Press, Oxford; 1892.Google Scholar
  21. Pinchon D, Hoggan PE: Rotation matrices for real spherical harmonics: general rotations of atomic orbitals in space-fixed axes. J. Phys. A, Math. Theor. 2007, 40: 1597–1610. 10.1088/1751-8113/40/7/011MathSciNetADSView ArticleGoogle Scholar
  22. Plummer HC: On the problem of distribution in globular star clusters. Mon. Not. R. Astron. Soc. 1911, 71: 460–470. 10.1093/mnras/71.5.460ADSView ArticleGoogle Scholar
  23. Price DJ, Monaghan JJ: An energy-conserving formalism for adaptive gravitational force softening in smoothed particle hydrodynamics and N -body codes. Mon. Not. R. Astron. Soc. 2007, 374: 1347–1358. 10.1111/j.1365-2966.2006.11241.xADSView ArticleGoogle Scholar
  24. Reinders J: Intel Threading Building Blocks. O’Reilly Media, Sebastopol; 2007.Google Scholar
  25. Salmon JK, Warren MS: Skeletons from the treecode closet. J. Comput. Phys. 1994, 111: 136–155. 10.1006/jcph.1994.1050ADSView ArticleGoogle Scholar
  26. Taura K, Nakashima J, Yokota R, Maruyama N: A task parallel implementation of fast multipole methods. Proceedings of the 2012 SC Companion: High Performance Computing, Networking Storage and Analysis 2012, 617–625. 10.1109/SC.Companion.2012.86View ArticleGoogle Scholar

Copyright

© Dehnen; licensee Springer 2014

This article is published under license to BioMed Central Ltd. Open Access This is an Open Access article distributed under the terms of the Creative Commons Attribution License http://(http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.