2008
DOI: 10.1109/map.2008.4563583
|View full text |Cite
|
Sign up to set email alerts
|

A Sophisticated Parallel MLFMA for Scattering by Extremely Large Targets [EM Programmer's Notebook]

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
39
0

Year Published

2009
2009
2016
2016

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 76 publications
(39 citation statements)
references
References 19 publications
0
39
0
Order By: Relevance
“…The multilevel version of FMM, multilevel fast multipole algorithm (MLFMA), introduced in the mid 90's [37][38][39], have had a significant impact on the solution of large-scale problems with the IEMs. Recent parallel implementations of MLFMA are able to solve problems with the order 10 8 dof [40,41].…”
Section: Historical Overviewmentioning
confidence: 99%
“…The multilevel version of FMM, multilevel fast multipole algorithm (MLFMA), introduced in the mid 90's [37][38][39], have had a significant impact on the solution of large-scale problems with the IEMs. Recent parallel implementations of MLFMA are able to solve problems with the order 10 8 dof [40,41].…”
Section: Historical Overviewmentioning
confidence: 99%
“…The reason lies in that the number of boxes at coarse levels may be less than that of threads. Inspired by the hybrid MPI parallel scheme [13][14][15][16][17][18], a strategy is developed in this paper, where a transition level is chosen and different parallel methods are employed at coarse (levels with larger boxes than those at the transition level) levels and fine ones. In specific, parallelization is carried out on the loops over FFPs at coarse levels, and on the loops over boxes at other levels.…”
Section: Outline Of the Mlfmamentioning
confidence: 99%
“…A series of successes have actually been reached in this area [11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26]. Parallelization of the fast multipole method (FMM) and its recursive variant, the multilevel fast multipole algorithm (MLFMA) [12][13][14][15][16][17][18][19][20][21][22] is the most distinguished one among them. To date, most works on the parallelization of the FMM/MLFMA are purely based on message passing interface (MPI) for distributed memory parallel platforms [12][13][14][15][16][17][18][19][20].…”
Section: Introductionmentioning
confidence: 99%
“…For all these reasons, in last years the well-known Method of Moments [1] made way for acceleration techniques as the Fast Multipole Method (FMM) [2] and its multilevel version, the MLFMA [3,4]. In fact, the attention of many recent studies is concentrated on the improvement of the MLFMA parallelization over shared, distributed and mixed memory computers [5][6][7][8][9][10][11][12][13][14][15].…”
Section: Introductionmentioning
confidence: 99%