Error estimates for the fast multipole method. I. The two-dimensional case
- 8 March 1995
- journal article
- research article
- Published by The Royal Society in Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
- Vol. 448 (1934) , 389-400
- https://doi.org/10.1098/rspa.1995.0023
Abstract
The Greengard-Rokhlin algorithm is a new and interesting method for computing long-range interactions in particle systems. Although the method already has been implemented and claimed to be superior to traditional and other methods, no reliable estimates of the size of the error of the method have been given. We illustrate what the error actually is for the two-dimensional case, and derive an estimate for it. The estimate has a simple analytic form which will allow its use in tuning the algorithm for best efficiency.This publication has 13 references indexed in Scilit:
- On the Fast Multipole Method for Computing the Energy of Periodic Assemblies of Charged and Dipolar ParticlesJournal of Computational Physics, 1993
- The Fast Gauss TransformSIAM Journal on Scientific and Statistical Computing, 1991
- An algorithm for the simulation of condensed matter which grows as the 3/2 power of the number of particlesMolecular Physics, 1988
- A Fast Adaptive Multipole Algorithm for Particle SimulationsSIAM Journal on Scientific and Statistical Computing, 1988
- Hydrodynamic interactions in a suspension of spherical particlesThe Journal of Chemical Physics, 1988
- The Rapid Evaluation of Potential Fields in Particle SystemsPublished by MIT Press ,1988
- A fast algorithm for particle simulationsJournal of Computational Physics, 1987
- The evolution of a turbulent vortexCommunications in Mathematical Physics, 1982
- Simulation of electrostatic systems in periodic boundary conditions. I. Lattice sums and dielectric constantsProceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1980
- Debye screeningCommunications in Mathematical Physics, 1980