Show/Hide Menu
Hide/Show Apps
anonymousUser
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Açık Bilim Politikası
Açık Bilim Politikası
Frequently Asked Questions
Frequently Asked Questions
Browse
Browse
By Issue Date
By Issue Date
Authors
Authors
Titles
Titles
Subjects
Subjects
Communities & Collections
Communities & Collections
Efficient parallelization of the multilevel fast multipole algorithm for the solution of large-scale scattering problems
Download
index.pdf
Date
2008-08-01
Author
Ergül, Özgür Salih
Gurel, Levent
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
2
views
3
downloads
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 lambda 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.
Subject Keywords
Electrical and Electronic Engineering
URI
https://hdl.handle.net/11511/36798
Journal
IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION
DOI
https://doi.org/10.1109/tap.2008.926757
Collections
Department of Electrical and Electronics Engineering, Article