A parallel version of the fast multipole method

L. Greengard, W. D. Gropp

Research output: Contribution to journalArticle

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 languageEnglish (US)
Pages (from-to)63-71
Number of pages9
JournalComputers and Mathematics with Applications
Volume20
Issue number7
DOIs
StatePublished - 1990

Fingerprint

Fast multipole Method
Parallel architectures
Particle interactions
Data storage equipment
Sequential Methods
Potential Field
Parallel Architectures
Force Field
Shared Memory
Charge
Numerical Results
Necessary
Requirements
Evaluation
Interaction

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 journalArticle

@article{413416a1a3654d35848a8e2ac652b835,
title = "A parallel version of the fast multipole method",
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).",
author = "L. Greengard and Gropp, {W. D.}",
year = "1990",
doi = "10.1016/0898-1221(90)90349-O",
language = "English (US)",
volume = "20",
pages = "63--71",
journal = "Computers and Mathematics with Applications",
issn = "0898-1221",
publisher = "Elsevier Limited",
number = "7",

}

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 -