The DOI matches its Crossref record.
An algorithm for the simulation of condensed matter which grows as the 3/2 power of the number of particles
Abstract
Current supercomputers and the impending availability of large scale parallel machines makes possible the study by molecular dynamics of a number of fundamental problems in condensed matter science hitherto beyond our scope because of the enormous computing time involved. This is because a realistic model of such systems contains one or two orders of magnitude more particles than the systems studied to date. Moreover, the intermolecular forces between these particles will usually include contributions from distributions of permanent electric charges, so that the usual assumption of short-ranged forces cannot be made. We give a list of typical problems in this class and attack the problem of improving the performance of molecular dynamics algorithms to take advantage of these new architectures. We use the Jacobi theta function transformation to derive rapidly computable forms for the energy of and forces between large assemblies of N particles interacting in periodic boundary conditions as the sum of real space pair-pair interactions and one particle sums in reciprocal Fourier space. By suitable choice of the separation constant controlling the relative overheads of the two contributions, we show that the total overhead grows as N 3/2. We present an experimental investigation of the N dependence of the computing overhead performed on a Siemens VP200 vector processor. The advantages of the algorithm for parallel computation are also discussed.
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
Cited by
A smooth particle mesh Ewald method
Essmann, U., Perera, L., Berkowitz, M. L., Darden, T., Lee, H., & Pedersen, L. G. (1995) · The Journal of Chemical Physics · doi:10.1063/1.470117 · Cited by 22,514
Computer Simulation of Liquids
Allen, M. P., & Tildesley, D. J. (2017) · doi:10.1093/oso/9780198803195.001.0001 · Cited by 20,945
Scalable molecular dynamics with NAMD
Phillips, J. C., Braun, R., Wang, W., Gumbart, J., Tajkhorshid, E., Villa, E., Chipot, C., Skeel, R. D., Kalé, L., & Schulten, K. (2005) · Journal of Computational Chemistry · doi:10.1002/jcc.20289 · Cited by 16,914
Scalable molecular dynamics on CPU and GPU architectures with NAMD
Phillips, J. C., Hardy, D. J., Maia, J. D. C., Stone, J. E., Ribeiro, J. V., Bernardi, R. C., Buch, R., Fiorin, G., Hénin, J., Jiang, W., et al. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0014475 · Cited by 3,144
Ewald summation techniques in perspective: a survey
Toukmaji, A. Y., & Board, J. A. (1996) · Computer Physics Communications · doi:10.1016/0010-4655(96)00016-1 · Cited by 918
Metadata
- Authors
- Perram, J. W., Petersen, H. G., & De Leeuw, S. W.
- Venue
- Molecular Physics
- Publisher
- Informa UK Limited
- Published
- 1988-11
- Volume
- 65
- Issue
- 4
- Pages
- 875-893
- ISSN
- 0026-8976 (ISSN-L)
- 1362-3028
- OpenAlex
- W1992882086
- Cited by
- 250
- References
- 0
- FWCI
- 1.35
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An algorithm for the simulation of condensed matter which grows as the 3/2 power of the number of particles. https://app.cochat.ai/papers/10.1080/00268978800101471
- The paper
- Perram, J. W., Petersen, H. G., & De Leeuw, S. W. (1988). An algorithm for the simulation of condensed matter which grows as the 3/2 power of the number of particles. Molecular Physics. https://doi.org/10.1080/00268978800101471
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.