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

Metadata

Show full item record

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

Item Usage Stats

227
views

0
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

Suggestions

OpenMETU
Core

Efficient solution of the electric-field integral equation using the iterative LSQR algorithm Ergül, Özgür Salih (Institute of Electrical and Electronics Engineers (IEEE), 2008-01-01) In this letter, we consider iterative solutions of the three-dimensional electromagnetic scattering problems formulated by surface integral equations. We show that solutions of the electric-field integral equation (EFIE) can be improved by employing an iterative least-squares QR (LSQR) algorithm. Compared to many other Krylov subspace methods, LSQR provides faster convergence and it becomes an alternative choice to the time-efficient no-restart generalized minimal residual (GMRES) algorithm that requires la...
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....
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.
Fast and accurate solutions of extremely large integral-equation problems discretised with tens of millions of unknowns Gurel, L.; Ergül, Özgür Salih (Institution of Engineering and Technology (IET), 2007-04-26) The solution of extremely large scattering problems that are formulated by integral equations and discretised with tens of millions of unknowns is reported. Accurate and efficient solutions are performed by employing a parallel implementation of the multilevel fast multipole algorithm. The effectiveness of the implementation is demonstrated on a sphere problem containing more than 33 million unknowns, which is the largest integral-equation problem ever solved to our knowledge.
EFFICIENT SOLUTIONS OF METAMATERIAL PROBLEMS USING A LOW-FREQUENCY MULTILEVEL FAST MULTIPOLE ALGORITHM Ergül, Özgür Salih (EMW Publishing, 2010-01-01) We present fast and accurate sloutions of electromagnetics problems involving realistic metamaterial structures using a lowfrequency multilevel fast multipole algorithm (LF-MLFMA). Accelerating iterative solutions using robust preconditioning techniques may not be sufficient to reduce the overall processing time when the ordinary high-frequency MLFMA is applied to metamaterial problems. The major bottleneck, i.e., the low-frequency breakdown, should be eliminated for efficient sloutions. We show that the co...

Citation Formats

Ö. S. Ergül, “Efficient parallelization of the multilevel fast multipole algorithm for the solution of large-scale scattering problems,” IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION, pp. 2335–2345, 2008, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/36798.