Note to users. If you're seeing this message, it means that your browser cannot find this page's style/presentation instructions -- or possibly that you are using a browser that does not support current Web standards. Find out more about why this message is appearing, and what you can do to make your experience of our site the best it can be.

Site Tools

  • AAAS
  • Subscribe
  • Feedback

Site Search

Search Advanced

Science 12 August 1994:
Vol. 265. no. 5174, pp. 909 - 914
DOI: 10.1126/science.265.5174.909
Prev | Table of Contents | Next

Articles

Fast Algorithms for Classical Physics

Leslie Greengard 1

1 Courant Institute of Mathematical Sciences, New York University, New York, NY 10012, USA.

Some of the recently developed fast summation methods that have arisen in scientific computing are described. These methods require an amount of work proportional to N or N log N to evaluate all pairwise interactions in an ensemble of N particles. Traditional methods, by contrast, require an amount of work proportional to N2. As a result, largescale simulations can be carried out using only modest computer resources. In combination with supercomputers, it is possible to address questions that were previously out of reach. Problems from diffusion, gravitation, and wave propagation are considered.

ADVERTISEMENT
Click Me!

ADVERTISEMENT
Click Me!

To Advertise     Find Products

Science. ISSN 0036-8075 (print), 1095-9203 (online)