Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 274

The DOI matches its Crossref record.

Performance characteristics of tree codes

Hernquist, Lars·1987·The Astrophysical Journal Supplement Series

Abstract

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1086/191215

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 274

Metadata

Authors
Hernquist, L.
Venue
The Astrophysical Journal Supplement Series
Published
1987-08
Volume
64
Pages
715
ISSN
  • 0067-0049 (ISSN-L)
  • 1538-4365
OpenAlex
W2062561353
Cited by
274
References
0
Type
conference abstract
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Performance characteristics of tree codes. https://app.cochat.ai/papers/10.1086/191215
The paper
Hernquist, L. (1987). Performance characteristics of tree codes. The Astrophysical Journal Supplement Series. https://doi.org/10.1086/191215

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.