loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Fast Multipole Algorithm
January/February 2000 (vol. 2 no. 1)
pp. 76-79
ASCII Text
x 
 
John Board, Klaus Schulten, "The Fast Multipole Algorithm," Computing in Science and Engineering, vol. 2, no. 1, pp. 76-79, January/February, 2000.
 
 
BibTex
x
 
@article{ 10.1109/5992.814662,
author = {John Board and Klaus Schulten},
title = {The Fast Multipole Algorithm},
journal ={Computing in Science and Engineering},
volume = {2},
number = {1},
issn = {1521-9615},
year = {2000},
pages = {76-79},
doi = {http://doi.ieeecomputersociety.org/10.1109/5992.814662},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - MGZN
JO - Computing in Science and Engineering
TI - The Fast Multipole Algorithm
IS - 1
SN - 1521-9615
SP76
EP79
EPD - 76-79
A1 - John Board,
A1 - Klaus Schulten,
PY - 2000
VL - 2
JA - Computing in Science and Engineering
ER -
 
Accurate computation of the mutual interactions of N particles through electrostatic or gravitational potential has impeded progress in many areas of simulation science. The Fast Multipole Algorithm provides an efficient scheme for reducing computational complexity.
Citation:
John Board, Klaus Schulten, "The Fast Multipole Algorithm," Computing in Science and Engineering, vol. 2, no. 1, pp. 76-79, Jan./Feb. 2000, doi:10.1109/5992.814662
Usage of this product signifies your acceptance of the Terms of Use.