A hierarchical O(N) force calculation algorithm

Journal of Computational Physics

Volumn 179, Issue 1, 2002, Pages 27-42

  Dehnen, Walter ^a  

^a MAX PLANCK INSTITUT FÜR ASTRONOMIE   (Germany)

Author keywords

Adaptive algorithms; Fast multipole method; N body simulations; Tree code

Indexed keywords

CODES (SYMBOLS); TREES (MATHEMATICS);

APPROXIMATE COMPUTATION; CALCULATION ALGORITHMS; CELL-CELL INTERACTION; CUBIC CELLS; FAST-MULTIPOLE METHODS; FORCE CALCULATION; HIERARCHICAL TREE; LONG-RANGE FORCES; N-BODY SIMULATION; TREE CODE;

ADAPTIVE ALGORITHMS;

EID: 0037054401     PISSN: 00219991     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcph.2002.7026     Document Type: Article

References (16)

1. A hierarchical O(N log N) force calculation algorithm
2. A fast algorithm for particle simulations
3. A new version of the fast multipole method for the Laplace equation in three dimensions
4. A fast adaptive multipole algorithm in three dimensions
5. A comparison between the fast multipole algorithm and the tree code to evaluate gravitational forces in 3D
6. A very fast and momentum-conserving tree code
7. A portable parallel particle program
8. Skeletons from the tree code closet
9. ⊙ stars
10. Optimal smoothing for N-body codes
11. Towards optimal softening in three-dimensional N-body codes-I. Minimizing the force error
12. An analytic model for spherical galaxies and bulges
13. Optimal softening for force calculations in collisionless N-body simulations
14. GRAPE-5: A special purpose computer for N-body simulations
15. A tree code with special purpose processor
16. The stellar dynamics toolbox NEMO