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
Comparisons of FMM implementations employing different formulations and iterative solvers
Date
2003-06-27
Author
Gürel, Levent
Ergül, Özgür Salih
Metadata
Show full item record
Item Usage Stats
37
views
0
downloads
Cite This
In order to solve large mathematical formulations of real-life electromagnetic problems, we must use advances in both solution algorithms and computer hardware. The fast multipole method (FMM) and its multilevel version, the multilevel fast multipole algorithm (MLFMA), are two of the preferred choices for the algorithm due to their reduced computational complexities and memory requirements. A parallel architecture is preferred for the hardware due to its increased computing power, with a consequent parallel implementation of the MLFMA. Some of the high-level choices that need to be made to implement the MLFMA are as follows: integral-equation (IE) formulation - EFIE, MFIE, or combined-field IE (CFIE); iterative solver - Krylov-subspace methods such as different conjugate gradient methods or generalized minimal residual; preconditioner - near-field (NF), filtered NF, block-diagonal or diagonal preconditioners, or no preconditioner; initial guess. These parameters are extensively investigated. For this purpose, a series of scattering problems of various sizes (at different frequencies) containing different numbers of unknowns are used as a testbed.
URI
https://hdl.handle.net/11511/71576
DOI
https://doi.org/10.1109/APS.2003.1217391
Conference Name
2003 IEEE International Antennas and Propagation Symposium and USNC/CNC/URSI North American Radio Science Meeting , vol.1, Columbus, OH, United States Of America,
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Multilayer Iterative Solutions of Large-Scale Electromagnetic Problems Using MLFMA
Ucuncu, Arif; Onol, Can; Ergül, Özgür Salih (2017-09-27)
We present multilayer solutions of large-scale electromagnetic problems using the multilevel fast multipole algorithm (MLFMA). With the conventional algebraic preconditioners based on the available near-field interactions, the cost of iterative solutions may exceed the linearithmic complexity, particularly for ill-conditioned systems, despite the efficient matrix-vector multiplications by MLFMA. We show that, using a multilayer approach employing approximate and full versions of MLFMA, the complexity can be...
Efficient Three-Layer Iterative Solutions of Electromagnetic Problems Using the Multilevel Fast Multipole Algorithm
Onol, Can; Ucuncu, Arif; Ergül, Özgür Salih (2017-05-19)
We present a three-layer iterative algorithm for fast and efficient solutions of electromagnetic problems formulated with surface integral equations. The strategy is based on nested iterative solutions employing the multilevel fast multipole algorithm and its approximate forms. We show that the three-layer mechanism significantly reduces solution times, while it requires no additional memory as opposed to algebraic preconditioners. Numerical examples involving three-dimensional scattering problems are prese...
Parallel-MLFMA Solutions of Large-Scale Problems Involving Composite Objects
Ergül, Özgür Salih (2012-07-14)
We present a parallel implementation of the multilevel fast multipole algorithm (MLFMA) for fast and accurate solutions of large-scale electromagnetics problems involving composite objects with dielectric and metallic parts. Problems are formulated with the electric and magnetic current combined-field integral equation (JMCFIE) and solved iteratively with MLFMA on distributed-memory architectures. Numerical examples involving canonical and complicated objects, such as optical metamaterials, are presented to...
A Parallel Numerical Solver Using Hierarchically Tiled Arrays
Brodman, James C.; Evans, G. Carl; Manguoğlu, Murat; Sameh, Ahmed; Garzaran, Maria J.; Padua, David (2011-01-01)
Solving linear systems is an important problem for scientific computing. Exploiting parallelism is essential for solving complex systems. and this traditionally involves writing parallel algorithms on top of a library such as MPI. The SPIKE family of algorithms is one well-known example of a parallel solver for linear systems. The Hierarchically Tiled Array data type extends traditional data-parallel array operations with explicit tiling and allows programmers to directly manipulate tiles. The tiles of the...
On the Lagrange interpolation in multilevel fast multipole algorithm
Ergül, Özgür Salih (2006-07-14)
In this paper the Lagrange interpolation employed in the multilevel fast multipole algorithm (MLFMA) is considered as part of the efforts to obtain faster and more efficient solutions for large problems of computational electromagnetics. For the translation operator, this paper presents the choice of the parameters for optimal interpolation. Also, for the aggregation and disaggregation processes, the interpolation matrices are discussed and an efficient way of improving the accuracy by employing the poles a...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
L. Gürel and Ö. S. Ergül, “Comparisons of FMM implementations employing different formulations and iterative solvers,” 2003, vol. 1, Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/71576.
