Improving the convergence rate of the conjugate gradient FFT method using subdomain basis functions

A technique to improve the convergence rate of the conjugate gradient-fast Fourier transform (CG-FFT) method is presented. The procedure involves the incorporation of subdomain basis functions associated with the current representation of linear and planar radiating elements. It is shown that signif...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on antennas and propagation Vol. 37; no. 7; pp. 893 - 900
Main Authors Barkeshli, K., Volakis, J.L.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.07.1989
Institute of Electrical and Electronics Engineers
Subjects
Antennas
Applied sciences
Conducting materials
Convergence
Convolution
Exact sciences and technology
Fast Fourier transforms
Fourier transforms
Gradient methods
Integral equations
Iterative algorithms
Iterative methods
Radiocommunications
Strips
Telecommunications
Telecommunications and information theory
Conjugate gradient method
Wire antenna
Fast Fourier transformation
Process improvement
Antenna
Convergence
Online AccessGet full text

Cover

More Information
Summary:A technique to improve the convergence rate of the conjugate gradient-fast Fourier transform (CG-FFT) method is presented. The procedure involves the incorporation of subdomain basis functions associated with the current representation of linear and planar radiating elements. It is shown that significant improvements are achieved in the convergence of the CG-FFT when using sinusoidal basis functions. Numerical results are presented for thin cylindrical dipoles, conducting strips, and material plates of various sizes. In all cases, an increase in the rate of convergence by a factor of two or better was observed.< >
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0018-926X
1558-2221
DOI:10.1109/8.29384