A hierarchical O(N log N) force-calculation algorithm

Details A hierarchical O(N log N) force-calculation algorithm A hierarchical O(N log N) force-calculation algorithm

Dec 1986

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1986natur.324..446b&link_type=abstract

Nature (ISSN 0028-0836), vol. 324, Dec. 4, 1986, p. 446-449.

Statistics

Computation

990

Computational Astrophysics, Many Body Problem, Numerical Integration, Stellar Motions, Algorithms, Hierarchies

Scientific paper

A novel method is described of directly calculating the force on N in the gravitational N-body problem that grows only as N log N. The technique uses a tree-structured hierarchical subdivision of space into cubic cells, each of which is recursively divided into eight subcells whenever more than one particle is found to occupy the same cell. This tree is constructed anew at every time step, avoiding ambiguity and tangling. Advantages over potential-solving codes include accurate local interactions, freedom from geometrical assumptions and restrictions, and applicability to a wide class of systems, including planetary, stellar, galactic, and cosmological ones. Advantages over previous hierarchical tree-codes include simplicity and the possibility of rigorous analysis of error.

Affiliated with

Also associated with

No associations

Rating

A hierarchical O(N log N) force-calculation algorithm 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 A hierarchical O(N log N) force-calculation algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A hierarchical O(N log N) force-calculation algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1126981