A fast algorithm for particle simulations

249Citations
Citations of this article
545Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

An algorithm is presented for the rapid evaluation of the potential and force fields in systems involving large numbers of particles whose interactions are Coulombic or gravitational in nature. For a system ofNparticles, an amount of work of the orderO(N2) has traditionally been required to evaluate all pairwise interactions, unless some approximation or truncation method is used. The algorithm of the present paper requires an amount of work proportional toNto evaluate all interactions to within roundoff error, making it considerably more practical for large-scale problems encountered in plasma physics, fluid dynamics, molecular dynamics, and celestial mechanics. © 1997 Academic Press.

Cite

CITATION STYLE

APA

Greengard, L., & Rokhlin, V. (1997). A fast algorithm for particle simulations. Journal of Computational Physics, 135(2), 280–292. https://doi.org/10.1006/jcph.1997.5706

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free