A fast algorithm for particle simulations

L. Greengard, V. Rokhlin

Research output: Contribution to journalArticlepeer-review

Abstract

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.

Original languageEnglish (US)
Pages (from-to)325-348
Number of pages24
JournalJournal of Computational Physics
Volume73
Issue number2
DOIs
StatePublished - Dec 1987

ASJC Scopus subject areas

  • Numerical Analysis
  • Modeling and Simulation
  • Physics and Astronomy (miscellaneous)
  • Physics and Astronomy(all)
  • Computer Science Applications
  • Computational Mathematics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A fast algorithm for particle simulations'. Together they form a unique fingerprint.

Cite this