2013
DOI: 10.1109/jproc.2012.2194269
|View full text |Cite
|
Sign up to set email alerts
|

MLFMA-FFT Parallel Algorithm for the Solution of Extremely Large Problems in Electromagnetics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
38
0
1

Year Published

2015
2015
2023
2023

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 56 publications
(42 citation statements)
references
References 24 publications
0
38
0
1
Order By: Relevance
“…The parallelization within each task is attained using OpenMP, which exploits the fast memory access in the shared-memory multi-core processors. Finally, we remark that, for a very large number of subdomains, a highly scalable parallel performance in radiation coupling can be achieved by a hybrid MLFMA-FFT algorithm, which has been demonstrated in [53,54].…”
Section: Radiation Coupling Among Subdomainsmentioning
confidence: 83%
“…The parallelization within each task is attained using OpenMP, which exploits the fast memory access in the shared-memory multi-core processors. Finally, we remark that, for a very large number of subdomains, a highly scalable parallel performance in radiation coupling can be achieved by a hybrid MLFMA-FFT algorithm, which has been demonstrated in [53,54].…”
Section: Radiation Coupling Among Subdomainsmentioning
confidence: 83%
“…In order to extend the practical applicability of SIE-MoM to larger structures, considerable efforts have been made towards the development of fast, efficient algorithms that can reduce the high costs of MoM in terms of both storage and computer processing time. Specifically, we single out the fast multipole method (FMM) [54] and its variants, the multilevel fast multipole algorithm (MLFMA) [27,28], and the MLFMA combined with the fast Fourier transform (FFT) [30][31][32]. 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.…”
Section: Acceleration Techniquesmentioning
confidence: 99%
“…The convolution is accelerated in the transformed domain by applying the FFT. By so doing, the workload can be distributed among parallel processes by plane wave samples almost without inter-process communication or synchronization (note that the FFT is never parallelized [32]). A schematic description of this method is shown in Fig.…”
Section: Acceleration Techniquesmentioning
confidence: 99%
See 2 more Smart Citations