The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
The Fast Multipole Method: Numerical Implementation
Open accessAbstract
We study integral methods applied to the resolution of the Maxwell equations where the linear system is solved using an iterative method which requires only matrix–vector products. The fast multipole method (FMM) is one of the most efficient methods used to perform matrix–vector products and accelerate the resolution of the linear system. A problem involving N degrees of freedom may be solved in CN iter N log N floating operations, where C is a constant depending on the implementation of the method. In this article several techniques allowing one to reduce the constant C are analyzed. This reduction implies a lower total CPU time and a larger range of application of the FMM. In particular, new interpolation and anterpolation schemes are proposed which greatly improve on previous algorithms. Several numerical tests are also described. These confirm the efficiency and the theoretical complexity of the FMM.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Electromagnetic scattering by surfaces of arbitrary shape
Rao, S., Wilton, D. R., & Glisson, A. W. (1982) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.1982.1142818 · Cited by 5,432
A fast algorithm for particle simulations
Greengard, L., & Rokhlin, V (1987) · Journal of Computational Physics · doi:10.1016/0021-9991(87)90140-9 · Cited by 4,868
Multilevel fast multipole algorithm for electromagnetic scattering by large complex objects
Song, J., Lu, C. C., & Chew, W. C. (1997) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.633855 · Cited by 1,646
Song, J., & Chew, W. C. (1995) · Microwave and Optical Technology Letters · doi:10.1002/mop.4650100107 · Cited by 854
Rapid solution of integral equations of scattering theory in two dimensions
Rokhlin, V. (1990) · Journal of Computational Physics · doi:10.1016/0021-9991(90)90107-c · Cited by 815
Parallel Preconditioning with Sparse Approximate Inverses
Grote, M. J., & Huckle, T. (1997) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827594276552 · Cited by 600
On the degrees of freedom of scattered fields
Bucci, O. M., & Franceschetti, G. (1989) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.29386 · Cited by 533
The continuous fast multipole method
White, C. A., Johnson, B. G., Gill, P. M. W., & Head-Gordon, M. (1994) · Chemical Physics Letters · doi:10.1016/0009-2614(94)01128-1 · Cited by 402
A multilevel matrix decomposition algorithm for analyzing scattering from large structures
Michielssen, E., & Boag, A. (1996) · IEEE Transactions on Antennas and Propagation · doi:10.1109/8.511816 · Cited by 361
Degrees of Freedom of an Image
Toraldo di Francia, G. (1969) · Journal of the Optical Society of America · doi:10.1364/josa.59.000799 · Cited by 345
Cited by
Preconditioning Techniques for Large Linear Systems: A Survey
Benzi, M. (2002) · Journal of Computational Physics · doi:10.1006/jcph.2002.7176 · Cited by 1,221
Birgin, E. G., Martı́nez, J. M., Martı́nez, L., & Rocha, G. B. (2013) · Journal of Chemical Theory and Computation · doi:10.1021/ct3009683 · Cited by 13
Metadata
- Authors
- Darve, E.
- Venue
- Journal of Computational Physics
- Publisher
- Elsevier BV
- Published
- 2000-05
- Volume
- 160
- Issue
- 1
- Pages
- 195-240
- ISSN
- 0021-9991 (ISSN-L)
- OpenAlex
- W1987724179
- Cited by
- 373
- References
- 23
- FWCI
- 8.77
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Fast Multipole Method: Numerical Implementation. https://app.cochat.ai/papers/10.1006/jcph.2000.6451
- The paper
- Darve, E. (2000). The Fast Multipole Method: Numerical Implementation. Journal of Computational Physics. https://doi.org/10.1006/jcph.2000.6451
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.