The DOI matches its Crossref record.
A fast algorithm for particle simulations
Open accessAbstract
An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles whose interactions are Coulombic or gravitational in nature. For a system of N particles, an amount of work of the order O(N2) has traditionally been required to evaluate all pairwise interactions, unless some approximation or truncation method is used. The algorithm of the present paper requires an amount of work proportional to N to evaluate all interactions to within roundoff error, making it considerably more practical for large-scale problems encountered in plasma physics, fluid dynamics, molecular dynamics, and celestial mechanics.
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
Cited by
Fast Parallel Algorithms for Short-Range Molecular Dynamics
Plimpton, S. (1995) · Journal of Computational Physics · doi:10.1006/jcph.1995.1039 · Cited by 44,721
Hybrid functionals based on a screened Coulomb potential
Heyd, J., Scuseria, G. E., & Ernzerhof, M. (2003) · The Journal of Chemical Physics · doi:10.1063/1.1564060 · Cited by 19,629
te Velde, G., Bickelhaupt, F. M., Baerends, E. J., Fonseca Guerra, C., van Gisbergen, S. J. A., Snijders, J. G., & Ziegler, T. (2001) · Journal of Computational Chemistry · doi:10.1002/jcc.1056 · Cited by 10,152
Image registration methods: a survey
Zitová, B., & Flusser, J. (2003) · Image and Vision Computing · doi:10.1016/s0262-8856(03)00137-9 · Cited by 6,423
The General Utility Lattice Program ( GULP )
Gale, J. D., & Rohl, A. L. (2003) · Molecular Simulation · doi:10.1080/0892702031000104887 · Cited by 2,265
Reconstruction and representation of 3D objects with radial basis functions
Carr, J. C., Beatson, R. K., Cherrie, J. B., Mitchell, T. J., Fright, W. R., McCallum, B. C., & Evans, T. R. (2001) · Proceedings of the 28th annual conference on Computer graphics and interactive techniques · doi:10.1145/383259.383266 · Cited by 1,852
The plasma simulation code: A modern particle-in-cell code with patch-based load-balancing
Germaschewski, K., Fox, W., Abbott, S., Ahmadi, N., Maynard, K., Wang, L., Ruhl, H., & Bhattacharjee, A. (2016) · Journal of Computational Physics · doi:10.1016/j.jcp.2016.05.013 · Cited by 107
Protein sequence‐to‐structure learning: Is this the end(‐to‐end revolution)?
Laine, E., Eismann, S., Elofsson, A., & Grudinin, S. (2021) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.26235 · Cited by 44
“Spherical harmonics have played a prominent role in molecular surface representations for several decades(144,145) and are also at the heart of the classical fast multipole method.(146)”
BackgroundFast approximate computations with Cauchy matrices and polynomials
Pan, V. (2017) · Mathematics of Computation · doi:10.1090/mcom/3204 · Cited by 21
“refer the reader to [DV98], [EGH13], [MRT05], [CDG06], [CGS07], [VVM], [X12], [XXG12], [X13], [XXCB14], [B10], [BY13], [GR87], [DGR96], [CGR98], and the bibliography therein on FMM and HSS matrices.”
Method
Metadata
- Authors
- Greengard, L., & Rokhlin, V
- Venue
- Journal of Computational Physics
- Publisher
- Elsevier BV
- Published
- 1987-12
- Volume
- 73
- Issue
- 2
- Pages
- 325-348
- ISSN
- 0021-9991 (ISSN-L)
- OpenAlex
- W2083206954
- Cited by
- 4,868
- References
- 0
- FWCI
- 10.55
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.
