The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
A Hierarchical (N) Force Calculation Algorithm
Open accessAbstract
A novel code for the approximate computation of long-range forces between N mutually interacting bodies is presented. The code is based on a hierarchical tree of cubic cells and features mutual cell–cell interactions which are calculated via a Cartesian Taylor expansion in a symmetric way, such that total momentum is conserved. The code benefits from an improved and simple multipole acceptance criterion that reduces the force error and the computational effort. For N≳104, the computational costs are found empirically to rise sublinearly with N. For applications in stellar dynamics, this is the first competitive code with complexity O(N); it is faster than the standard tree code by a factor of 10 or more.
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.
Integrity signals
Registry
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.
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
Cites
A fast algorithm for particle simulations
Greengard, L., & Rokhlin, V (1987) · Journal of Computational Physics · doi:10.1016/0021-9991(87)90140-9 · Cited by 4,868
A hierarchical O(N log N) force-calculation algorithm
Barnes, J., & Hut, P. (1986) · Nature · doi:10.1038/324446a0 · Cited by 3,698
An analytical model for spherical galaxies and bulges
Hernquist, L. (1990) · The Astrophysical Journal · doi:10.1086/168845 · Cited by 3,126
A new version of the Fast Multipole Method for the Laplace equation in three dimensions
Greengard, L., & Rokhlin, V. (1997) · Acta Numerica · doi:10.1017/s0962492900002725 · Cited by 879
A Fast Adaptive Multipole Algorithm in Three Dimensions
Cheng, H., Greengard, L., & Rokhlin, V. (1999) · Journal of Computational Physics · doi:10.1006/jcph.1999.6355 · Cited by 702
Dynamic mass exchange in doubly degenerate binaries. I - 0.9 and 1.2 solar mass stars
Benz, W., Cameron, A. G. W., Press, W. H., & Bowers, R. L. (1990) · The Astrophysical Journal · doi:10.1086/168273 · Cited by 453
A Very Fast and Momentum-conserving Tree Code
Dehnen, W. (2000) · The Astrophysical Journal · doi:10.1086/312724 · Cited by 232
Self-citationSkeletons from the Treecode Closet
Salmon, J. K., & Warren, M. S. (1994) · Journal of Computational Physics · doi:10.1006/jcph.1994.1050 · Cited by 217
A portable parallel particle program
Warren, M. S., & Salmon, J. K. (1995) · Computer Physics Communications · doi:10.1016/0010-4655(94)00177-4 · Cited by 168
Optimal softening for force calculations in collisionless N-body simulations
Athanassoula, E., Fady, E., Lambert, J.-C., & Bosma, A. (2000) · Monthly Notices of the Royal Astronomical Society · doi:10.1046/j.1365-8711.2000.03316.x · Cited by 92
Cited by
What determines the strength and the slowdown rate of bars?
Athanassoula, E. (2003) · Monthly Notices of the Royal Astronomical Society · doi:10.1046/j.1365-8711.2003.06473.x · Cited by 596
Athanassoula, E. (2005) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2005.08872.x · Cited by 533
Simulating cosmic structure formation with the gadget-4 code
Springel, V., Pakmor, R., Zier, O., & Reinecke, M. (2021) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/stab1855 · Cited by 422
Evolution of Stellar Bars in Live Axisymmetric Halos: Recurrent Buckling and Secular Growth
Martinez‐Valpuesta, I., Shlosman, I., & Heller, C. (2006) · The Astrophysical Journal · doi:10.1086/498338 · Cited by 418
Quantifying the heart of darkness with GHALO – a multibillion particle simulation of a galactic halo
Stadel, J., Potter, D., Moore, B., Diemand, J., Madau, P., Zemp, M., Kuhlen, M., & Quilis, V. (2009) · Monthly Notices of the Royal Astronomical Society: Letters · doi:10.1111/j.1745-3933.2009.00699.x · Cited by 388
Metadata
- Authors
- Dehnen, W.
- Venue
- Journal of Computational Physics
- Publisher
- Elsevier BV
- Published
- 2002-06
- Volume
- 179
- Issue
- 1
- Pages
- 27-42
- ISSN
- 0021-9991 (ISSN-L)
- OpenAlex
- W2080457038
- Cited by
- 267
- References
- 10
- FWCI
- 5.29
- Type
- journal article
- Language
- en
- Open access
- green
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
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.