The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
A Fast Adaptive Multipole Algorithm for Particle Simulations
Abstract
This paper describes an algorithm for the rapid evaluation of the potential and force fields in systems involving large numbers of particles whose interactions are described by Coulomb’s law. Unlike previously published schemes, the algorithm of this paper has an asymptotic CPU time estimate of $O(N)$, where N is the number of particles in the simulation, and does not depend on the statistics of the distribution for its efficient performance. The numerical examples we present indicate that it should be an algorithm of choice in many situations of practical interest.
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
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
Self-citationComputer Simulation Using Particles
Hockney, R. W., & Eastwood, J. W. (2021) · CRC Press eBooks · doi:10.1201/9780367806934 · Cited by 4,383
Rapid solution of integral equations of classical potential theory
Rokhlin, V (1985) · Journal of Computational Physics · doi:10.1016/0021-9991(85)90002-6 · Cited by 1,414
Self-citationAn Efficient Program for Many-Body Simulation
Appel, A. W. (1985) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0906008 · Cited by 546
Cited by
Computer Simulation of Liquids
Allen, M. P., & Tildesley, D. J. (2017) · doi:10.1093/oso/9780198803195.001.0001 · Cited by 20,945
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
Self-citationFast wavelet transforms and numerical algorithms I
Beylkin, G., Coifman, R., & Rokhlin, V. (1991) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160440202 · Cited by 1,770
Self-citationFast Fourier Transforms for Nonequispaced Data
Dutt, A., & Rokhlin, V. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914081 · Cited by 918
Self-citationA 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
Self-citationUnderstanding deep convolutional networks
Mallat, S. (2016) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2015.0203 · Cited by 688
Greengard, L., & Strain, J. (1991) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0912004 · Cited by 491
Self-citationMultilevel 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
Fast algorithms for hierarchically semiseparable matrices
Xia, J., Chandrasekaran, S., Gu, M., & Li, X. S. (2010) · Numerical Linear Algebra with Applications · doi:10.1002/nla.691 · Cited by 305
Metadata
- Authors
- Carrier, J., Greengard, L., & Rokhlin, V.
- Venue
- SIAM Journal on Scientific and Statistical Computing
- Published
- 1988-07
- Volume
- 9
- Issue
- 4
- Pages
- 669-686
- ISSN
- 0196-5204 (ISSN-L)
- 2168-3417
- OpenAlex
- W2077852080
- Cited by
- 617
- References
- 4
- FWCI
- 4.04
- 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.