z-logo
Premium
Contraction integral equation method in three‐dimensional electromagnetic modeling
Author(s) -
Hursán Gábor,
Zhdanov Michael S.
Publication year - 2002
Publication title -
radio science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.371
H-Index - 84
eISSN - 1944-799X
pISSN - 0048-6604
DOI - 10.1029/2001rs002513
Subject(s) - integral equation , mathematics , iterative method , contraction (grammar) , operator (biology) , convergence (economics) , electric field integral equation , mathematical optimization , mathematical analysis , computer science , algorithm , medicine , biochemistry , chemistry , repressor , transcription factor , economics , gene , economic growth
The integral equation method has been proven to be an efficient tool to model three‐dimensional electromagnetic problems. Owing to the full linear system to be solved, the method has been considered effective only in the case of models consisting of a strongly limited number of cells. However, recent advances in matrix storage and multiplication issues facilitate the modeling of horizontally large structures. Iterative methods are the most feasible techniques for obtaining accurate solutions for such problems. In this paper we demonstrate that the convergence of iterative methods can be improved significantly, if the original integral equation is replaced by an equation based on the modified Green's operator with the norm less or equal to one. That is why we call this technique the Contraction Integral Equation (CIE) method. We demonstrate that application of the modified Green's operator can be treated as a preconditioning of the original problem. We have performed a comparative study of the convergence of different iterative solvers applied to the original and contraction integral equations. The results show that the most effective solvers are the BIGGSTAB, QMRCGSTAB, and CGMRES algorithms, equipped with preconditioning based on the CIE method.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here