A Fast Algorithm for Particle Simulations

✍ Scribed by L. Greengard; V. Rokhlin

• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 407 KB
• Volume: 135
• Category: Article
• ISSN: 0021-9991
• DOI: 10.1006/jcph.1997.5706

✦ Synopsis

We restrict our attention in this paper to the case where the potential (or force) at a point is a sum of pairwise An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles interactions. More specifically, we consider potentials of whose interactions are Coulombic or gravitational in nature. For a the form system of N particles, an amount of work of the order O(N 2 ) has traditionally been required to evaluate all pairwise interactions, un-⌽ ϭ ⌽ far ϩ (⌽ near ϩ ⌽ external ), less 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 where ⌽ near (when present) is a rapidly decaying potential considerably more practical for large-scale problems encountered in (e.g., Van der Waals), ⌽ external (when present) is indepenplasma physics, fluid dynamics, molecular dynamics, and celestial dent of the number of particles, and ⌽ far , the far-field mechanics. ᮊ 1987 Academic Press potential, is Coulombic or gravitational. Such models describe classical celestial mechanics and many problems in plasma physics and molecular dynamics. In the vortex * The authors were supported in part by the Office of Naval Research under Grant N00014-82-K-0184.

tional to the number of particles, but with a small constant 280