The fast multipole algorithm
Publication
, Journal Article
Board, J; Schulten, K
Published in: Computing in Science and Engineering
January 1, 2000
Accurate computation of the mutual interactions of N particles through electrostatic or gravitational forces has impeded progress in many areas of simulation science. The fast multipole algorithm provides an efficient scheme for reducing computational complexity.
Duke Scholars
Published In
Computing in Science and Engineering
DOI
ISSN
1521-9615
Publication Date
January 1, 2000
Volume
2
Issue
1
Start / End Page
76 / 79
Related Subject Headings
- Fluids & Plasmas
- 46 Information and computing sciences
- 40 Engineering
- 0805 Distributed Computing
- 0802 Computation Theory and Mathematics
- 0103 Numerical and Computational Mathematics
Citation
APA
Chicago
ICMJE
MLA
NLM
Board, J., & Schulten, K. (2000). The fast multipole algorithm. Computing in Science and Engineering, 2(1), 76–79. https://doi.org/10.1109/5992.814662
Board, J., and K. Schulten. “The fast multipole algorithm.” Computing in Science and Engineering 2, no. 1 (January 1, 2000): 76–79. https://doi.org/10.1109/5992.814662.
Board J, Schulten K. The fast multipole algorithm. Computing in Science and Engineering. 2000 Jan 1;2(1):76–9.
Board, J., and K. Schulten. “The fast multipole algorithm.” Computing in Science and Engineering, vol. 2, no. 1, Jan. 2000, pp. 76–79. Scopus, doi:10.1109/5992.814662.
Board J, Schulten K. The fast multipole algorithm. Computing in Science and Engineering. 2000 Jan 1;2(1):76–79.
Published In
Computing in Science and Engineering
DOI
ISSN
1521-9615
Publication Date
January 1, 2000
Volume
2
Issue
1
Start / End Page
76 / 79
Related Subject Headings
- Fluids & Plasmas
- 46 Information and computing sciences
- 40 Engineering
- 0805 Distributed Computing
- 0802 Computation Theory and Mathematics
- 0103 Numerical and Computational Mathematics