Efficient parallelization of the multilevel fast multipole algorithm for the solution of large-scale scattering problems

Date

2008-08

Editor(s)

Advisor

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

IEEE Transactions on Antennas and Propagation

Print ISSN

0018-926X

Electronic ISSN

1558-2221

Publisher

Institute of Electrical and Electronics Engineers

Volume

56

Issue

8

Pages

2335 - 2345

Language

English

Journal Title

Journal ISSN

Volume Title

Series

Abstract

We present fast and accurate solutions of large-scale scattering problems involving three-dimensional closed conductors with arbitrary shapes using the multilevel fast multipole algorithm (MLFMA). With an efficient parallelization of MLFMA, scattering problems that are discretized with tens of millions of unknowns are easily solved on a cluster of computers. We extensively investigate the parallelization of MLFMA, identify the bottlenecks, and provide remedial procedures to improve the efficiency of the implementations. The accuracy of the solutions is demonstrated on a scattering problem involving a sphere of radius 110 discretized with 41 883 638 unknowns, the largest integral-equation problem solved to date. In addition to canonical problems, we also present the solution of real-life problems involving complicated targets with large dimensions

Course

Other identifiers

Book Title

Citation