A Fast Adaptive Multipole Algorithm in Three Dimensions
Open Access
- 1 November 1999
- journal article
- Published by Elsevier in Journal of Computational Physics
- Vol. 155 (2), 468-498
- https://doi.org/10.1006/jcph.1999.6355
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- A precorrected-FFT method for electrostatic analysis of complicated 3-D structuresIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1997
- A new version of the Fast Multipole Method for the Laplace equation in three dimensionsActa Numerica, 1997
- Achieving Linear Scaling for the Electronic Quantum Coulomb ProblemScience, 1996
- A renormalization method for the evaluation of lattice sumsJournal of Mathematical Physics, 1994
- Multipole-accelerated capacitance extraction algorithms for 3-D structures with multiple dielectricsIEEE Transactions on Circuits and Systems I: Regular Papers, 1992
- On the fast matrix multiplication in the boundary element method by panel clusteringNumerische Mathematik, 1989
- A fast algorithm for particle simulationsJournal of Computational Physics, 1987
- A hierarchical O(N log N) force-calculation algorithmNature, 1986
- A method of local corrections for computing the velocity field due to a distribution of vortex blobsJournal of Computational Physics, 1986
- Rapid solution of integral equations of classical potential theoryJournal of Computational Physics, 1985