Statistics – Computation
Scientific paper
Aug 1987
adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1987apjs...64..715h&link_type=abstract
Astrophysical Journal Supplement Series (ISSN 0067-0049), vol. 64, Aug. 1987, p. 715-734. Research supported by the University o
Statistics
Computation
320
Computational Astrophysics, Fortran, Hierarchies, Many Body Problem, Trees (Mathematics), Astronomical Models, Cray Computers, Memory (Computers)
Scientific paper
A Fortran implementation of the Barnes-Hut hierarchical tree algorithm is presented and analyzed in the context of the astrophysical N-body problem. The errors introduced into the force calculation as a result of the clustering of distant particles, and their influence on the relaxation time and physical conservation laws, are considered. Tree algorithms should be suitable for studying a wide range of astrophysical phenomena, including potentially both collisional and collisionless systems. As an example, a simulation of the decay of a satellite orbit around a self-gravitating disk with N = 32,768, performed with the tree method, is compared with previous calculations.
No associations
LandOfFree
Performance characteristics of tree codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Performance characteristics of tree codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Performance characteristics of tree codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-1340218