2006
DOI: 10.1163/156939306776930321
|View full text |Cite
|
Sign up to set email alerts
|

A Highly Efficient Parallel Approach of Multi-level Fast Multipole Algorithm

Abstract: Based on the different characteristics of memory requirement and CPU time at different levels in the Multi-Level Fast Multipole Algorithm (MLFMA), a new highly efficient parallel approach is proposed, which employs different techniques to parallelize the plane waves and translation matrices at different levels. The formulae for efficiently implementing this proposed approach are presented by theoretical analysis and numerical experiments. Several techniques have also been employed to reduce memory requirement.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
29
0

Year Published

2007
2007
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(29 citation statements)
references
References 3 publications
0
29
0
Order By: Relevance
“…For the EFIE represented by (8), the Nyström method is implemented as follows. By the discretization with N segments, the EFIE becomes…”
Section: Nyström Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…For the EFIE represented by (8), the Nyström method is implemented as follows. By the discretization with N segments, the EFIE becomes…”
Section: Nyström Methodsmentioning
confidence: 99%
“…Fast Multiple Method (FMM) is thought of as a very robust numerical approach in dealing with electrically large problems [4][5][6][7][8][9]. The FMM can solve a matrix equation with 20 million unknowns on a common workstation [7].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Because of that, many MoM acceleration strategies based on iterative solutions have emerged to reduce the computational complexity. Among these acceleration techniques, it must be pointed out the Fast Multipole Method (FMM) [4] and its multilevel version, the Multilevel Fast Multipole Algorithm (MLFMA) [5][6][7][8], which are extensively used at present. Nevertheless, the FMM and, in general, other methods that tackle the electromagnetic analysis within the framework of iterative schemes usually meet with difficulties when dealing with radiation problems.…”
Section: Introductionmentioning
confidence: 99%
“…In [9][10][11], Geng and colleagues developed an approximate means of handling the dyadic half-space Green's function, with application to the fast multipole method (FMM) and the multilevel fast multipole algorithm (MLFMA), which were originally developed for targets in free space [12][13][14][15][16][17][18][19][20][21][22]. In their works, the near MLFMA terms are evaluated via the use of the exact dyadic Green's function, the latter evaluated efficiently via the complex-image technique [23].…”
Section: Introductionmentioning
confidence: 99%