A FAST ALGORITHM FOR PARTICLE SIMULATIONS (REPRINTED FROM THE JOURNAL-OF-COMPUTATIONAL-PHYSICS, VOL 73, PG 325-348, 1987)

Citation
L. Greengard et V. Rokhlin, A FAST ALGORITHM FOR PARTICLE SIMULATIONS (REPRINTED FROM THE JOURNAL-OF-COMPUTATIONAL-PHYSICS, VOL 73, PG 325-348, 1987), Journal of computational physics, 135(2), 1997, pp. 280-292
Citations number
8
Categorie Soggetti
Mathematical Method, Physical Science","Computer Science Interdisciplinary Applications","Physycs, Mathematical
ISSN journal
00219991
Volume
135
Issue
2
Year of publication
1997
Pages
280 - 292
Database
ISI
SICI code
0021-9991(1997)135:2<280:AFAFPS>2.0.ZU;2-0
Abstract
An algorithm is presented for the rapid evaluation of the potential an d force fields in systems involving large numbers of particles whose i nteractions are Coulombic or gravitational in nature, Far a system of N particles, an amount of work of the order O(N-2) has traditionally b een required to evaluate all pairwise interactions, unless some approx imation or truncation method is used, The algorithm of the present pap er requires an amount of work proportional to N to evaluate all intera ctions to within roundoff error, making it considerably more practical for large-scale problems encountered in plasma physics, fluid dynamic s, molecular dynamics, and celestial mechanics. (C) 1987 Academic Pres s .