The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
An Efficient Program for Many-Body Simulation
Abstract
The simulation of N particles interacting in a gravitational force field is useful in astrophysics, but such simulations become costly for large N. Representing the universe as a tree structure with the particles at the leaves and internal nodes labeled with the centers of mass of their descendants allows several simultaneous attacks on the computation time required by the problem. These approaches range from algorithmic changes (replacing an $O(N^2 )$ algorithm with an algorithm whose time-complexity is believed to be $O(N\log N)$) to data structure modifications, code-tuning, and hardware modifications. The changes reduced the running time of a large problem $(N = 10,000)$ by a factor of four hundred. This paper describes both the particular program and the methodology underlying such speedups.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Computer Simulation Using Particles
Hockney, R. W., & Eastwood, J. W. (2021) · CRC Press eBooks · doi:10.1201/9780367806934 · Cited by 4,383
The Large-Scale Structure of the Universe
(2007) · Astronomy and Astrophysics Library · doi:10.1007/978-3-540-73478-9_2 · Cited by 3,219
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
The large-scale structure of the Universe
Stephenson, F. R. (1981) · Endeavour · doi:10.1016/0160-9327(81)90118-6 · Cited by 921
Numerical treatment of ordinary differential equations by extrapolation methods
Bulirsch, R., & Stoer, J. (1966) · Numerische Mathematik · doi:10.1007/bf02165234 · Cited by 847
Numerical Experiments on Spiral Structure
Miller, R. H., Prendergast, K. H., & Quirk, W. J. (1970) · The Astrophysical Journal · doi:10.1086/150593 · Cited by 188
Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces
Bentley, J. L., & Friedman (1978) · IEEE Transactions on Computers · doi:10.1109/tc.1978.1675043 · Cited by 129
N-body simulations of galaxy clustering. I - Initial conditions and galaxy collapse times
Aarseth, S. J., Turner, E. L., & R., I. G. J. (1979) · The Astrophysical Journal · doi:10.1086/156892 · Cited by 114
Cited by
The cosmological simulation code gadget-2
Springel, V. (2005) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2005.09655.x · Cited by 6,368
Graph drawing by force‐directed placement
Fruchterman, T. M. J., & Reingold, E. M. (1991) · Software: Practice and Experience · doi:10.1002/spe.4380211102 · Cited by 6,352
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
GADGET: a code for collisionless and gasdynamical cosmological simulations
Springel, V., Yoshida, N., & White, S. D. M. (2001) · New Astronomy · doi:10.1016/s1384-1076(01)00042-2 · Cited by 1,664
Qin, F., & Brosseau, C. (2012) · Journal of Applied Physics · doi:10.1063/1.3688435 · Cited by 1,202
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
MOLECULAR DYNAMICS SIMULATIONS OF BIOMOLECULES: Long-Range Electrostatic Effects
Sagui, C., & Darden, T. A. (1999) · Annual Review of Biophysics and Biomolecular Structure · doi:10.1146/annurev.biophys.28.1.155 · Cited by 690
The origin of the Moon and the single-impact hypothesis III
Benz, W., Cameron, A. G. W., & Melosh, H. J. (1989) · Icarus · doi:10.1016/0019-1035(89)90129-2 · Cited by 643
A Fast Adaptive Multipole Algorithm for Particle Simulations
Carrier, J., Greengard, L., & Rokhlin, V. (1988) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0909044 · Cited by 617
Callahan, P. B., & Kosaraju, S. R. (1995) · Journal of the ACM · doi:10.1145/200836.200853 · Cited by 543
A rapid hierarchical radiosity algorithm
Hanrahan, P., Salzman, D., & Aupperle, L. (1991) · Proceedings of the 18th annual conference on Computer graphics and interactive techniques · doi:10.1145/122718.122740 · Cited by 517
Multilevel matrix multiplication and fast solution of integral equations
Brandt, A., & Lubrecht, A. A. (1990) · Journal of Computational Physics · doi:10.1016/0021-9991(90)90171-v · Cited by 445
Iterative solution of linear systems
Freund, R. W., Golub, G. H., & Nachtigal, N. M. (1992) · Acta Numerica · doi:10.1017/s0962492900002245 · Cited by 434
GALICS- I. A hybrid N-body/semi-analytic model of hierarchical galaxy formation
Hatton, S., Devriendt, J. E. G., Ninin, S., Bouchet, F. R., Guiderdoni, B., & Vibert, D. (2003) · Monthly Notices of the Royal Astronomical Society · doi:10.1046/j.1365-8711.2003.05589.x · Cited by 321
SIMULATIONS OF STRUCTURE FORMATION IN THE UNIVERSE
Bertschinger, E. (1998) · Annual Review of Astronomy and Astrophysics · doi:10.1146/annurev.astro.36.1.599 · Cited by 307
Derivation and efficient implementation of the fast multipole method
White, C. A., & Head-Gordon, M. (1994) · The Journal of Chemical Physics · doi:10.1063/1.468354 · Cited by 301
Metadata
- Authors
- Appel, A. W.
- Venue
- SIAM Journal on Scientific and Statistical Computing
- Published
- 1985-01
- Volume
- 6
- Issue
- 1
- Pages
- 85-103
- ISSN
- 0196-5204 (ISSN-L)
- 2168-3417
- OpenAlex
- W2011842427
- Cited by
- 546
- References
- 12
- FWCI
- 9.89
- Type
- journal article
- 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
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.