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
Parallel preconditioners for solutions of dense linear systems with tens of millions of unknowns
Download
index.pdf
Date
2007-11-09
Author
Malas, Tahir
Ergül, Özgür Salih
Gurel, Levent
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
174
views
0
downloads
Cite This
We propose novel parallel preconditioning schemes for the iterative solution of integral equation methods. In particular, we try to improve convergence rate of the ill-conditioned linear systems formulated by the electric-field integral equation, which is the only integral-equation formulation for targets having open surfaces. For moderate-size problems, iterative solution of the neat-field system enables much faster convergence compared to the widely used sparse approximate inverse preconditioner. For larger systems, we propose an approximation strategy to the multilevel fast multipole algorithm (MLFMA) to be used as a preconditioner. Our numerical experiments reveal that this scheme significantly outperforms other preconditioners. With the combined effort of effective preconditioners and an efficiently parallelized MLFMA, we are able to solve targets with tens of millions of unknowns, which are the largest problems ever reported in computational electromagnetics.
Subject Keywords
Data structures
,
Computational complexity
,
Geometry
,
Noise measurement
,
Iterative methods
,
Sparse matrices
,
Computational electromagnetics
,
MLFMA
,
Integral equations
,
Linear systems
URI
https://hdl.handle.net/11511/47290
DOI
https://doi.org/10.1109/iscis.2007.4456895
Collections
Department of Electrical and Electronics Engineering, Conference / Seminar
Suggestions
OpenMETU
Core
Numerical Design of Testing Functions for the Magnetic-Field Integral Equation
Karaosmanoglu, Bariscan; Ergül, Özgür Salih (2016-04-15)
We present a novel numerical approach to design testing functions for the magnetic-field integral equation (MFIE). Enforcing the compatibility of matrix equations derived from MFIE and the electric-field integral equation (EFIE) for the same problem, testing weights for MFIE are determined on given templates of testing functions. The resulting MFIE systems produce more accurate results that the conventional MFIE implementations, without increasing the number of iterations and processing time. The design pro...
Iterative solution of the normal-equations form of the electric-field integral equation
Ergül, Özgür Salih (2007-06-15)
In this paper, we show that transforming the original equations into normal equations improves the convergence of EFIE significantly. We present the solutions of EFIE by employing the least-squares QR (LSQR) algorithm, which corresponds to a stable application of the conjugate gradient (CG) algorithm on the normal equations. Despite the squaring of the condition number due to such a transformation into the normal equations, LSQR improves the convergence rate of the iterative solutions of EFIE and performs b...
Exact Solutions of Some Partial Differential Equations Using the Modified Differential Transform Method
Cansu Kurt, Ümmügülsüm; Ozkan, Ozan (2018-03-01)
In this paper, we present the modification of the differential transform method by using Laplace transform and Pade approximation to obtain closed form solutions of linear and nonlinear partial differential equations. Some illustrative examples are given to demonstrate the activeness of the proposed technique. The obtained results ensure that this modified method is capable of solving a large number of linear and nonlinear PDEs that have wide application in science and engineering. It solves the drawbacks i...
Accurate Solutions of Extremely Large Integral-Equation Problems in Computational Electromagnetics
Ergül, Özgür Salih (2013-02-01)
Accurate simulations of real-life electromagnetics problems with integral equations require the solution of dense matrix equations involving millions of unknowns. Solutions of these extremely large problems cannot be achieved easily, even when using the most powerful computers with state-of-the-art technology. However, with the multilevel fast multipole algorithm (MLFMA) and parallel MLFMA, we have been able to obtain full-wave solutions of scattering problems discretized with hundreds of millions of unknow...
Hybrid Surface Integral Equations for Optimal Analysis of Perfectly Conducting Bodies
Karaosmanoglu, Bariscan; Ergül, Özgür Salih (2015-07-24)
We consider hybrid formulations involving simultaneous applications of the electric-field integral equation (EFIE), the magnetic-field integral equation (MFIE), and the combined-field integral equation (CFIE) for the electromagnetic analysis of three-dimensional conductors with arbitrary geometries. By selecting EFIE, MFIE, and CFIE regions on a given object, and optimizing these regions in accordance with the simulation requirements, one can construct an optimal hybrid-field integral equation (HFIE) that p...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
T. Malas, Ö. S. Ergül, and L. Gurel, “Parallel preconditioners for solutions of dense linear systems with tens of millions of unknowns,” 2007, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/47290.