A Hierarchical Partitioning Strategy for an Efficient Parallelization of the Multilevel Fast Multipole Algorithm

Download

index.pdf

Date

2009-06-01

Author

Ergül, Özgür Salih

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

316
views

134
downloads

We present a novel hierarchical partitioning strategy for the efficient parallelization of the multilevel fast multipole algorithm (MLFMA) on distributed-memory architectures to solve large-scale problems in electromagnetics. Unlike previous parallelization techniques, the tree structure of MLFMA is distributed among processors by partitioning both clusters and samples of fields at each level. Due to the improved load-balancing, the hierarchical strategy offers a higher parallelization efficiency than previous approaches, especially when the number of processors is large. We demonstrate the improved efficiency on scattering problems discretized with millions of unknowns. In addition, we present the effectiveness of our algorithm by solving very large scattering problems involving a conducting sphere of radius 210 wavelengths and a complicated real-life target with a maximum dimension of 880 wavelengths. Both of the objects are discretized with more than 200 million unknowns.

Subject Keywords

Electrical and Electronic Engineering

URI

https://hdl.handle.net/11511/35366

Journal

IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION

DOI

https://doi.org/10.1109/tap.2009.2019913

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Hierarchical parallelisation strategy for multilevel fast multipole algorithm in computational electromagnetics Ergül, Özgür Salih (Institution of Engineering and Technology (IET), 2008-01-03) A hierarchical parallelisation of the multilevel fast multipole algorithm (MLFMA) for the efficient solution of large-scale problems in computational electromagnetics is presented. The tree structure of MLFMA is distributed among the processors by partitioning both the clusters and the samples of the fields appropriately for each level. The parallelisation efficiency is significantly improved compared to previous approaches, where only the clusters or only the fields are partitioned in a level.
Efficient parallelization of the multilevel fast multipole algorithm for the solution of large-scale scattering problems Ergül, Özgür Salih (Institute of Electrical and Electronics Engineers (IEEE), 2008-08-01) 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 imp...
Implementation of the Equivalence Principle Algorithm for Potential Integral Equations Farshkaran, Ali; Ergül, Özgür Salih (Institute of Electrical and Electronics Engineers (IEEE), 2019-05-01) A novel implementation of the equivalence principle algorithm (EPA) employing potential integral equations (PIEs) is presented. EPA is generalized to be compatible with PIEs that are used to formulate inner problems inside equivalence surfaces. Based on the stability of PIEs, the resulting EPA-PIE implementation is suitable for low-frequency problems involving dense discretizations with respect to wavelength. Along with the formulation and a clear demonstration of the EPA-PIE mechanism, high accuracy, stabi...
Enhancing the accuracy of the interpolations and anterpolations in MLFMA Ergül, Özgür Salih (Institute of Electrical and Electronics Engineers (IEEE), 2006-01-01) We present an efficient technique to reduce the interpolation and anterpolation (transpose interpolation) errors in the aggregation and disaggregation processes of the multilevel fast multipole algorithm (MLFMA), which is based on the sampling of the radiated and incoming fields over all possible solid angles, i.e., all directions on the sphere. The fields sampled on the sphere are subject to various operations, such as interpolation, aggregation, translation, disaggregation, anterpolation, and integration....
Derivation of length extension formulas for complementary sets of sequences using orthogonal filterbanks Candan, Çağatay (Institution of Engineering and Technology (IET), 2006-11-23) A method for the construction of complementary sets of sequences using polyphase representation of orthogonal filterbanks is presented. It is shown that the case of two-channel filterbanks unifies individually derived length extension formulas for complementary sequences into a common framework and the general M-channel case produces novel formulas for the extension of complementary sets of sequences. The presented technique can also be used to generate polyphase and multilevel sequences.

Citation Formats

Ö. S. Ergül, “A Hierarchical Partitioning Strategy for an Efficient Parallelization of the Multilevel Fast Multipole Algorithm,” IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, pp. 1740–1750, 2009, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/35366.