Abstract
This paper presents a parallel version of the fast multipole method (FMM). The FMM is a recently developed scheme for the evaluation of the potential and force fields in systems of particles whose interactions are Coulombic or gravitational in nature. The sequential method requires O(N) operations to obtain the fields due to N charges, rather than the O(N2) operations required by the direct calculation. Here, we describe the modifications necessary for implementation of the method on parallel architectures and show that the expected time requirements grow as log N when using N processors. Numerical results are given for a shared memory machine (the Encore Multimax 320).
| Original language | English (US) |
|---|---|
| Pages (from-to) | 63-71 |
| Number of pages | 9 |
| Journal | Computers and Mathematics with Applications |
| Volume | 20 |
| Issue number | 7 |
| DOIs | |
| State | Published - 1990 |
Fingerprint
ASJC Scopus subject areas
- Applied Mathematics
- Computational Mathematics
- Modeling and Simulation
Cite this
A parallel version of the fast multipole method. / Greengard, L.; Gropp, W. D.
In: Computers and Mathematics with Applications, Vol. 20, No. 7, 1990, p. 63-71.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A parallel version of the fast multipole method
AU - Greengard, L.
AU - Gropp, W. D.
PY - 1990
Y1 - 1990
N2 - This paper presents a parallel version of the fast multipole method (FMM). The FMM is a recently developed scheme for the evaluation of the potential and force fields in systems of particles whose interactions are Coulombic or gravitational in nature. The sequential method requires O(N) operations to obtain the fields due to N charges, rather than the O(N2) operations required by the direct calculation. Here, we describe the modifications necessary for implementation of the method on parallel architectures and show that the expected time requirements grow as log N when using N processors. Numerical results are given for a shared memory machine (the Encore Multimax 320).
AB - This paper presents a parallel version of the fast multipole method (FMM). The FMM is a recently developed scheme for the evaluation of the potential and force fields in systems of particles whose interactions are Coulombic or gravitational in nature. The sequential method requires O(N) operations to obtain the fields due to N charges, rather than the O(N2) operations required by the direct calculation. Here, we describe the modifications necessary for implementation of the method on parallel architectures and show that the expected time requirements grow as log N when using N processors. Numerical results are given for a shared memory machine (the Encore Multimax 320).
UR - http://www.scopus.com/inward/record.url?scp=0002897633&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0002897633&partnerID=8YFLogxK
U2 - 10.1016/0898-1221(90)90349-O
DO - 10.1016/0898-1221(90)90349-O
M3 - Article
VL - 20
SP - 63
EP - 71
JO - Computers and Mathematics with Applications
JF - Computers and Mathematics with Applications
SN - 0898-1221
IS - 7
ER -