A Very Fast and Momentum-conserving Tree Code
Open Access
- 10 June 2000
- journal article
- research article
- Published by American Astronomical Society in The Astrophysical Journal
- Vol. 536 (1) , L39-L42
- https://doi.org/10.1086/312724
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 N = 105 and at the same level of accuracy, the new code is about 4 times faster than the tree code. For large N, the computational costs are found to scale almost linearly with N, which can also be supported by a theoretical argument, and the advantage over the tree code increases with ever larger N.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- A Fast Adaptive Multipole Algorithm in Three DimensionsJournal of Computational Physics, 1999
- A Comparison between the Fast Multipole Algorithm and the Tree-Code to Evaluate Gravitational Forces in 3-DJournal of Computational Physics, 1998
- A portable parallel particle programComputer Physics Communications, 1995
- Skeletons from the Treecode ClosetJournal of Computational Physics, 1994
- An analytical model for spherical galaxies and bulgesThe Astrophysical Journal, 1990
- A modified tree code: Don't laugh; It runsJournal of Computational Physics, 1990
- Dynamic mass exchange in doubly degenerate binaries. I - 0.9 and 1.2 solar mass starsThe Astrophysical Journal, 1990
- A fast algorithm for particle simulationsJournal of Computational Physics, 1987
- A hierarchical O(N log N) force-calculation algorithmNature, 1986