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
Efficient preconditioning strategies for the multilevel fast multipole algorithm
Date
2007-03-30
Author
Gurel, Levent
Malas, Tahir
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
168
views
0
downloads
Cite This
For the iterative solutions of the integral equation methods employing the multilevel fast multipole algorithm (MLFMA), effective preconditioning techniques should be developed for robustness and efficiency. Preconditioning techniques for such problems can be broadly classified as fixed preconditioners that are generated from the sparse near-field matrix and variable ones that can make use of MLFMA with the help of the flexible solvers. Among fixed preconditioners, we show that an incomplete LU preconditioner depending on threshold (ILUT) is very successful in sequential implementations, provided that pivoting is applied whenever the incomplete factors become unstable. For parallel preconditioners, sparse approximate inverses (SAI) can be used; however, they are not as successful as ILUT for the electric-field integral equation. For a remedy, we employ variable preconditioning, and we iteratively solve the neax-field system in each major iteration. However, for very large systems, neither of these methods succeeds to reduce the iteration counts as desired because of the thinning of the near-field matrices for increasing problem sizes. Considering this fact, we develop a preconditioner using MLFMA, with which we solve an approximate system. Respective advantages of these different preconditioners are demonstrated on a variety of problems ranging in both geometry and size.
Subject Keywords
Scattering
URI
https://hdl.handle.net/11511/54570
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Modified Superformula Contours Optimized via Genetic Algorithms for Exponentially Converging 2D Solutions of MFIE
Guler, Sadri; Onol, Can; Ergül, Özgür Salih; Sever, Emrah; Dikmen, Fatih; Tuchkin, Yury A. (2017-05-25)
An infinitely smooth parametrical representation with derivatives of all orders is used, resulting into exponentially converging solutions of magnetic field integral equation (MFIE) in 2D either for TM or TE polarized excitations. A version of superformula modified for this purpose has been subject to optimization of its parameters via genetic algorithms to provide smooth parameterization for a desired boundary in two-dimensional problems. The organization of the MFIE kernel and convergence of the solution ...
Fast-Multipole-Method Solutions of New Potential Integral Equations
Gür, Uğur Meriç; Karaosmanoglu, Bariscan; Ergül, Özgür Salih (2017-09-27)
A recently introduced potential integral equations for stable analysis of low-frequency problems involving dense discretizations with respect to wavelength are solved by using the fast multipole method (FMM). Two different implementations of FMM based on multipoles and an approximate diagonalization employing scaled plane waves are developed and used for rigorous solutions of low-frequency problems. Numerical results on canonical problems demonstrate excellent stability and solution capabilities of both imp...
Rigorous Solutions of Large-Scale Scattering Problems Discretized with Hundreds of Millions of Unknowns
Guerel, L.; Ergül, Özgür Salih (2009-09-18)
We present fast and accurate solutions of large-scale scattering problems using a parallel implementation of the multilevel fast multipole algorithm (MLFMA). By employing a hierarchical partitioning strategy, MLFMA can be parallelized efficiently on distributed-memory architectures. This way, it becomes possible to solve very large problems discretized with hundreds of millions of unknowns. Effectiveness of the developed simulation environment is demonstrated on various scattering problems involving canonic...
Electromagnetic scattering from cluster of spheres using diagonalized vector addition theorem
Atasoy, Halil İbrahim; Koç, Seyit Sencer; Department of Electrical and Electronics Engineering (2014)
Our aim is to implement an FMM (Fast Multipole Method) solver using the approach given by Chew [35] for diagonalization of vector addition theorem. Scatterer bodies will be modeled as ensemble of smaller spheres with same constitutive properties and then will be analyzed using the FMM solver. For general scattering problems, it is hard to obtain an analytical solution. There are only some special cases where exact solutions are possible. Hence, for the investigation of problems where numbers of scatterers a...
Benchmark Solutions of Large Problems for Evaluating Accuracy and Efficiency of Electromagnetics Solvers
Gurel, Levent; Ergül, Özgür Salih (2011-07-08)
We present a set of benchmark problems involving conducting spheres and their solutions using a parallel implementation of the multilevel fast multipole algorithm (MLFMA). Accuracy of the implementation is tested by comparing the computational results with analytical Mie-series solutions. Reference solutions are made available on an interactive website to evaluate and compare the accuracy and efficiency of fast solvers. We also demonstrate the capabilities of our solver on real-life problems involving compl...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
L. Gurel, T. Malas, and Ö. S. Ergül, “Efficient preconditioning strategies for the multilevel fast multipole algorithm,” 2007, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/54570.