2012
DOI: 10.2528/pier12020203
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient High Order Multilevel Fast Multipole Algorithm for Electromagnetic Scattering Analysis

Abstract: Abstract-An efficient higher order MLFMA is developed by using an "extended-tree". With this extended-tree, the size of the box at the finest level is reduced, and the cost associated with the aggregation and disaggregation operations is significantly decreased. The sparse approximate inverse (SAI) preconditioner is utilized to accelerate the convergence of iterative solutions. The Cholesky factorization, instead of the often used QR factorization, is employed to construct the SAI preconditioner for cavity sca… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
24
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
7
2

Relationship

2
7

Authors

Journals

citations
Cited by 23 publications
(24 citation statements)
references
References 18 publications
0
24
0
Order By: Relevance
“…(9) using an in-house axially symmetric PO code. This solver is based on evaluating expression (9), and since only axially symmetric scatterers are considered the simulations in the PO solver are carried out in a number of seconds. A detailed description of the implementation of the solver is presented in [27].…”
Section: Approximative Computation Methods For Coated Scatterersmentioning
confidence: 99%
See 1 more Smart Citation
“…(9) using an in-house axially symmetric PO code. This solver is based on evaluating expression (9), and since only axially symmetric scatterers are considered the simulations in the PO solver are carried out in a number of seconds. A detailed description of the implementation of the solver is presented in [27].…”
Section: Approximative Computation Methods For Coated Scatterersmentioning
confidence: 99%
“…In order to reduce the requirements and accelerate simulations a number of numerical acceleration methods have been presented in the last decades. For MoM two such methods well suited for simulating electrically large scattering problems are the multilevel fast multipole method (MLFMM) [8][9][10] and the characteristic basis function method (CBF) [11][12][13]. The MLFMM scales in 3D as O(f 2 log(f )) [7] which is a significant improvement, but can still result in heavy computations for complicated structures.…”
Section: Introductionmentioning
confidence: 99%
“…The multilevel fast multipole algorithm is a powerful tool for accelerating the matrix-vector multiplication and it is shown to have ability to solve electrically large and complex problems [5][6][7]. Through employing the multilevel fast multipole algorithm (MLFMA), the capability of FE-BI has been improved greatly [8].…”
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%