2010
DOI: 10.2528/pier10061711
|View full text |Cite
|
Sign up to set email alerts
|

Solutions of Large-Scale Electromagnetics Problems Using an Iterative Inner-Outer Scheme With Ordinary and Approximate Multilevel Fast Multipole Algorithms

Abstract: Abstract-We present an iterative inner-outer scheme for the efficient solution of large-scale electromagnetics problems involving perfectlyconducting objects formulated with surface integral equations. Problems are solved by employing the multilevel fast multipole algorithm (MLFMA) on parallel computer systems.In order to construct a robust preconditioner, we develop an approximate MLFMA (AMLFMA) by systematically increasing the efficiency of the ordinary MLFMA. Using a flexible outer solver, iterative MLFMA s… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
15
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
9
1

Relationship

1
9

Authors

Journals

citations
Cited by 35 publications
(15 citation statements)
references
References 27 publications
0
15
0
Order By: Relevance
“…For these accuracy parameters and the given model of processors, the parallelization efficiency is around 85% leading to 54-fold speedup using 64 processes compared to the corresponding sequential solution [3,25]. Note that problems involving more complicated objects may require effective preconditioners, such as those based on the Schur-complement reduction for penetrable objects [5] and the two-level scheme for PEC objects [36] that are appropriate for MLFMA implementations. For more quantitative assessment of the accuracy and efficiency, Table 4 lists the number of iterations, total time (that is dominated by iterations), memory, and root-mean-square (RMS) error in computational values with respect to analytical values for the sphere problems.…”
Section: Numerical Examplesmentioning
confidence: 99%
“…For these accuracy parameters and the given model of processors, the parallelization efficiency is around 85% leading to 54-fold speedup using 64 processes compared to the corresponding sequential solution [3,25]. Note that problems involving more complicated objects may require effective preconditioners, such as those based on the Schur-complement reduction for penetrable objects [5] and the two-level scheme for PEC objects [36] that are appropriate for MLFMA implementations. For more quantitative assessment of the accuracy and efficiency, Table 4 lists the number of iterations, total time (that is dominated by iterations), memory, and root-mean-square (RMS) error in computational values with respect to analytical values for the sphere problems.…”
Section: Numerical Examplesmentioning
confidence: 99%
“…Such heavy computation complexity and memory cost are undesirable in many applications, e.g. the reconstruction of largescale induced electric or current density in discontinuous media in computational electromagnetics [19][20][21][22][23][24] or in radar signal research domain [25,26]. Therefore, it is necessary to reduce the computation time and the memory complexity in the G-IPRM.…”
Section: Introductionmentioning
confidence: 99%
“…In recent years, a significant amount of work has been devoted to design fast parallel algorithms that can reduce the O (n 2 ) computational complexity for the M-V product with boundary element equations, like the Fast Multipole Method (FMM) by V. Rokhlin [35], the H-matrix approach by W. Hackbush [25], the Adaptive Cross Approximation by M. Bebendorf [4], and other approaches. Since the pioneering work by Rokhlin and his co-authors, the Fast Multipole Algorithm continues to receive considerable attention in Electromagnetics, see e.g., [20,21,31,32,39].…”
Section: Introductionmentioning
confidence: 99%