Letter | Published:

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


Until recently the gravitational N-body problem has been modelled numerically either by direct integration, in which the computation needed increases as N2, or by an iterative potential method in which the number of operations grows as N log N. Here we describe a novel method of directly calculating the force on N bodies 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 are: accurate local interactions; freedom from geometrical assumptions and restrictions; and applicability to a wide class of systems, including (proto-)planetary, stellar, galactic and cosmological ones. Advantages over previous hierarchical tree-codes include simplicity and the possibility of rigorous analysis of error. Although we concentrate here on stellar dynamical applications, our techniques of efficiently handling a large number of long-range interactions and concentrating computational effort where most needed have potential applications in other areas of astrophysics as well.

Access optionsAccess options

Rent or Buy article

Get time limited or full article access on ReadCube.


All prices are NET prices.


  1. 1

    Aarseth, S. J. in Multiple Time Scales (ed Brackbill, J. U. & Cohen, B. I.) 377–418 (Academic Press, New York, 1985).

  2. 2

    Hockney, R. W. & Eastwood, J. W. Computer Simulation using Particles (McGraw-Hill, New York, 1981).

  3. 3

    Appel, A. SIAM J. Sei. statist. Comput. 6, 85–103 (1985).

  4. 4

    Jernigan, J. G. I.A.U. Symp. 113, 275–284.

  5. 5

    Porter, D. thesis, Physics Dept, Univ. California, Berkeley (1985).

  6. 6

    Abelson, H., Sussman, G. J. & Sussman, J. Structure and Interpretation of Computer Programs (MIT Press, Cambridge, Massachusetts, 1985).

Download references

Author information

Rights and permissions

Reprints and Permissions

About this article

Further reading


By submitting a comment you agree to abide by our Terms and Community Guidelines. If you find something abusive or that does not comply with our terms or guidelines please flag it as inappropriate.