2000
DOI: 10.1006/jcph.2000.6451
|View full text |Cite
|
Sign up to set email alerts
|

The Fast Multipole Method: Numerical Implementation

Abstract: 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 ar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

5
301
0
5

Year Published

2003
2003
2014
2014

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 304 publications
(311 citation statements)
references
References 62 publications
(45 reference statements)
5
301
0
5
Order By: Relevance
“…The latter are seen to be linear combinations of the Green's function for the Helmholtz equation (3), for which such a reformulation is known from earlier works, e.g. [3,4,8]…”
Section: Fast Multipole Method: Principlementioning
confidence: 82%
See 2 more Smart Citations
“…The latter are seen to be linear combinations of the Green's function for the Helmholtz equation (3), for which such a reformulation is known from earlier works, e.g. [3,4,8]…”
Section: Fast Multipole Method: Principlementioning
confidence: 82%
“…The present Note improves on the methodology of [5] by incorporating recent advances of FMM implementations for Maxwell equations (e.g. [8]), which allow to run BEM models of much larger size.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The original version of the fast multipole method relied on analytic expressions for the multipole expansion of the kernels but several kernel independent versions have been proposed [36,38]. For more details, the reader is referred to [60][61][62].…”
Section: Fast Multipole Methodsmentioning
confidence: 99%
“…Various fast summation schemes have been devised to provide matrix-vector products in O(N log β N) for such problems, where N is the number of unknowns and β ≥ 0 an integer depending on the method. They broadly fall under three different categories: -FFT (Fast Fourier Transform) based methods, -fast multipole methods [36][37][38][60][61][62], -hierarchical matrices [21,22,24].…”
Section: Covariance Functionsmentioning
confidence: 99%