Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
Hierarchical Parallelization of the Multilevel Fast Multipole Algorithm (MLFMA)
Download
index.pdf
Date
2013-02-01
Author
Gurel, Levent
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
292
views
0
downloads
Cite This
Due to its O(NlogN) complexity, the multilevel fast multipole algorithm (MLFMA) is one of the most prized algorithms of computational electromagnetics and certain other disciplines. Various implementations of this algorithm have been used for rigorous solutions of large-scale scattering, radiation, and miscellaneous other electromagnetics problems involving 3-D objects with arbitrary geometries. Parallelization of MLFMA is crucial for solving real-life problems discretized with hundreds of millions of unknowns. This paper presents the hierarchical partitioning strategy, which provides a very efficient parallelization of MLFMA on distributed-memory architectures. We discuss the advantages of the hierarchical strategy over previous approaches and demonstrate the improved efficiency on scattering problems discretized with millions of unknowns.
Subject Keywords
Computational electromagnetics
,
Multilevel fast multipole algorithm (MLFMA)
,
Parallelization
,
Surface integral equations
URI
https://hdl.handle.net/11511/47377
Journal
PROCEEDINGS OF THE IEEE
DOI
https://doi.org/10.1109/jproc.2012.2222331
Collections
Department of Electrical and Electronics Engineering, Article
Suggestions
OpenMETU
Core
PARALLEL MULTILEVEL FAST MULTIPOLE ALGORITHM FOR COMPLEX PLASMONIC METAMATERIAL STRUCTURES
Ergül, Özgür Salih (2013-11-09)
A parallel implementation of the multilevel fast multipole algorithm (MLFMA) is developed for fast and accurate solutions of electromagnetics problems involving complex plasmonic metamaterial structures. Composite objects that consist of multiple penetrable regions, such as dielectric, lossy, and plasmonic parts, are formulated rigorously with surface integral equations and solved iteratively via MLFMA. Using the hierarchical strategy for the parallelization, the developed implementation is capable of simul...
Efficient and Accurate Electromagnetic Optimizations Based on Approximate Forms of the Multilevel Fast Multipole Algorithm
Onol, Can; Karaosmanoglu, Bariscan; Ergül, Özgür Salih (2016-01-01)
We present electromagnetic optimizations by heuristic algorithms supported by approximate forms of the multilevel fast multipole algorithm (MLFMA). Optimizations of complex structures, such as antennas, are performed by considering each trial as an electromagnetic problem that can be analyzed via MLFMA and its approximate forms. A dynamic accuracy control is utilized in order to increase the efficiency of optimizations. Specifically, in the proposed scheme, the accuracy is used as a parameter of the optimiz...
Nested Iterative Solutions of Electromagnetic Problems Using Approximate Forms of the Multilevel Fast Multipole Algorithm
Onol, Can; Ucuncu, Arif; Karaosmanoglu, Bariscan; Ergül, Özgür Salih (2017-03-24)
Nested iterative solutions using full and approximate forms of the multilevel fast multipole algorithm (MLFMA) are presented for efficient analysis of electromagnetic problems. The developed mechanism is based on preconditioning an iterative solution via another iterative solution, and this way, nesting multiple solutions as layers. The accuracy is systematically reduced from top to bottom by using the on-the-fly characteristics of MLFMA, as well as the iterative residual errors. As a demonstration, a three...
Multifrequency and multidirection optimizations of antenna arrays using heuristic algorithms and the multilevel fast multipole algorithm
Onol, Can; Alkis, Sena; Gokce, Ozer; Ergül, Özgür Salih (2016-07-01)
We consider fast and efficient optimizations of arrays involving three-dimensional antennas with arbitrary shapes and geometries. Heuristic algorithms, particularly genetic algorithms, are used for optimizations, while the required solutions are carried out accurately and efficiently via the multilevel fast multipole algorithm(MLFMA). The superposition principle is employed to reduce the number of MLFMA solutions to the number of array elements per frequency. The developed mechanism is used to optimize arra...
Rigorous Analysis of Double-Negative Materials with the Multilevel Fast Multipole Algorithm
Ergül, Özgür Salih (2012-02-01)
We present rigorous analysis of double-negative materials (DNMs) with surface integral equations and the multilevel fast multipole algorithm (MLFMA). Accuracy and efficiency of numerical solutions are investigated when DNMs are formulated with two recently developed formulations, i.e., the combined tangential formulation (CTF) and the electric and magnetic current combined-field integral equation (JMCHE). Simulation results on canonical objects are consistent with previous results in the literature on ordin...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
L. Gurel and Ö. S. Ergül, “Hierarchical Parallelization of the Multilevel Fast Multipole Algorithm (MLFMA),”
PROCEEDINGS OF THE IEEE
, pp. 332–341, 2013, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47377.