Abstract
The development of the multilevel fast multipole algorithm (MLFMA) and its multiscale variants have enabled the use of integral equation (IE) based solvers to compute scattering from complicated structures. Development of scalable parallel algorithms, to extend the reach of these solvers, has been a topic of intense research for about a decade. In this paper, we present a new algorithm for parallel implementation of IE solver that is augmented with a wideband MLFMA and scalable on large number of processors. The wideband MLFMA employed here, to handle multiscale problems, is a hybrid combination of the accelerated Cartesian expansion (ACE) and the classical MLFMA. The salient feature of the presented parallel algorithm is that it is implicitly load balanced and exhibits higher performance. This is achieved by developing a strategy to partition the MLFMA tree, and hence the associated computations, in a self-similar fashion among the parallel processors. As detailed in the paper, the algorithm employs both spatial and direction partitioning approaches in a flexible manner to ensure scalable performance. Plethora of results are presented here to exhibit the scalability of this algorithm on 512 and more processors.
Original language | English |
---|---|
Article number | 5765662 |
Pages (from-to) | 2565-2577 |
Number of pages | 13 |
Journal | IEEE Transactions on Antennas and Propagation |
Volume | 59 |
Issue number | 7 |
DOIs | |
State | Published - Jul 2011 |
Funding
Manuscript received May 16, 2009; revised November 03, 2010; accepted January 29, 2011. Date of publication May 12, 2011; date of current version July 07, 2011. This work was supported by the National Science Foundation under Grants CCF-0729157 and DMS-0811197.
Keywords
- Accelerated Cartesian expansion (ACE)
- Cartesian expansions
- fast multipole method (FMM)
- fast solvers
- integral equation (IE)
- multipole methods
- parallel multilevel fast multipole algorithm (MLFMA)
- scattering
- self-similar tree
- wideband MLFMA