2007
DOI: 10.1109/tap.2007.898511
|View full text |Cite
|
Sign up to set email alerts
|

Massively Parallel Fast Multipole Method Solutions of Large Electromagnetic Scattering Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
32
0
6

Year Published

2009
2009
2016
2016

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 46 publications
(38 citation statements)
references
References 22 publications
0
32
0
6
Order By: Relevance
“…Based on Gegenbauer's addition theorem for the homogeneous Green function, the FMM reduces the computational cost to O(N 3/2 ), whereas its multilevel version achieves O(N log N ) by incorporating plain and adjoint interpolation schemes for the fields. The FFT extension of the latter (MLFMA-FFT) combines the algorithmic efficiency of MLFMA with the high scalability of FMM-FFT [55] via parallelization, which is optimal when using distributed multicore computer clusters. In MLFMA-FFT the translation stage at the top (coarsest) level of the multilevel Cartesian octree decomposition of the geometry is addressed in terms of a 3D circular convolution per sample of the plane wave expansion (Ewald sphere).…”
Section: Acceleration Techniquesmentioning
confidence: 99%
“…Based on Gegenbauer's addition theorem for the homogeneous Green function, the FMM reduces the computational cost to O(N 3/2 ), whereas its multilevel version achieves O(N log N ) by incorporating plain and adjoint interpolation schemes for the fields. The FFT extension of the latter (MLFMA-FFT) combines the algorithmic efficiency of MLFMA with the high scalability of FMM-FFT [55] via parallelization, which is optimal when using distributed multicore computer clusters. In MLFMA-FFT the translation stage at the top (coarsest) level of the multilevel Cartesian octree decomposition of the geometry is addressed in terms of a 3D circular convolution per sample of the plane wave expansion (Ewald sphere).…”
Section: Acceleration Techniquesmentioning
confidence: 99%
“…Algorithms with a lower computational complexity are usually more complex and their actual runtime can be dominated by fairly large prefactors. For example, the FFT-MLFMA algorithm has a higher computational complexity than the MLFMA [21], [22]. Nevertheless, the parallelization of the FFT-MLFMA algorithm is highly efficient (in a strong scaling sense) for current cluster sizes.…”
Section: Weak Scaling Analysis: Numerical Validationmentioning
confidence: 99%
“…As it is shown in [14,15], the FFT extension of the conventional FMM method allows to obtain a great reduction of the MVP CPU time with respect to the FMM. The method consists of employing the Fast Fourier Transform to speedup the translation stage in the framework of the FMM.…”
Section: Fmm-fft Algorithmmentioning
confidence: 99%
“…This variation of the single-level FMM was first proposed in [14] as an acceleration technique applied to almost planar surfaces. Later on, a parallelized implementation was applied to general three-dimensional geometries [15]. The method uses the FFT to speedup the translation stage resulting in a dramatic reduction of the matrix-vector product (MVP) time requirement with respect to the FMM.…”
Section: Introductionmentioning
confidence: 99%