2000
DOI: 10.1086/312724
|View full text |Cite
|
Sign up to set email alerts
|

A Very Fast and Momentum-conserving Tree Code

Abstract: The tree code for the approximate evaluation of gravitational forces is extended and substantially accelerated by including mutual cell-cell interactions. These are computed by a Taylor series in Cartesian coordinates and in a completely symmetric fashion, such that Newton's third law is satisfied by construction and that therefore momentum is exactly conserved. The computational effort is further reduced by exploiting the mutual symmetry of the interactions. For typical astrophysical problems with and at the … Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
233
0
1

Year Published

2002
2002
2012
2012

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 224 publications
(236 citation statements)
references
References 10 publications
2
233
0
1
Order By: Relevance
“…This leads to a force calculation step that is O(N) as each tree node interacts with a similar number of nodes independent of N and the number of nodes is proportional to the number of bodies. Building the tree is still O(N log N) but this is a small cost for simulations up to N ∼ 10 7 (Dehnen 2000). The Greengard & Rokhlin (1987) method used spherical harmonic expansions where the desired accuracy is achieved solely by changing the order of the expansions.…”
Section: Gravitymentioning
confidence: 99%
See 1 more Smart Citation
“…This leads to a force calculation step that is O(N) as each tree node interacts with a similar number of nodes independent of N and the number of nodes is proportional to the number of bodies. Building the tree is still O(N log N) but this is a small cost for simulations up to N ∼ 10 7 (Dehnen 2000). The Greengard & Rokhlin (1987) method used spherical harmonic expansions where the desired accuracy is achieved solely by changing the order of the expansions.…”
Section: Gravitymentioning
confidence: 99%
“…The Greengard & Rokhlin (1987) method used spherical harmonic expansions where the desired accuracy is achieved solely by changing the order of the expansions. For the majority of astrophysical applications the allowable force accuracies make it much more efficient to use fixed order Cartesian expansions and an opening angle criterion similar to standard tree codes (Salmon & Warren 1994, Dehnen 2000. This approach has the nice property of explicitly conserving momentum (as do PM and P 3 M codes).…”
Section: Gravitymentioning
confidence: 99%
“…Even if some of the progenitors of a given halo develop steep cusps through approximately spherical infall, one might well imagine these cusps becoming shallower through merging and subsequent relaxation. A recent paper by Dehnen (2005) suggests otherwise. On the basis of a theorem for phase mixing, Dehnen argues that in the merger of two (virialized) subhalos, the steepest cusp survives.…”
Section: Introductionmentioning
confidence: 99%
“…Elliott & Board (1996) successfully reduced the calculation cost in FMM from O(p 4 N) to O(p(log p) 1/2 N) by using a fast fourier transformation and optimal choice of the tree level. Dehnen (2000) proposed a Cartesian FMM, however, its calculation cost is estimated as O(p 6 N). Again this cost can be reduced to O(p 3/2 (log p) 1/2 N) by following Elliott & Board (1996).…”
Section: Higher Order Expansion and Application To Fmmmentioning
confidence: 99%
“…Thus, it is widely used in simulations of self-gravitating systems and the GRAPE (GRAvity PipE) series also adopts this form of the gravitational potential (Sugimoto et al, 1990;Ito et al, 1991;Okumura et al, 1993;Makino et al, 1997;Kawai et al, 2000;Makino et al, 2003;Kawai & Fukushige, 2006;Makino, 2005. Due to the wide adoption of the Plummer potential, there have been several studies on the choice of the optimal gravitational softening length (Merritt, 1996;Athanassoula et al, 2000;Dehnen, 2001).…”
Section: Introductionmentioning
confidence: 99%