The block-Toeplitz-matrix-based CG-FFT algorithm with an inexact sparse preconditioner for analysis of microstrip circuits

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journal

11 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)347-351
Journal / PublicationMicrowave and Optical Technology Letters
Volume34
Issue number5
Publication statusPublished - 5 Sep 2002

Abstract

In this Letter, the inexact preconditioned conjugate-gradient (CG) algorithm with inner-outer iteration and the block-Toeplitz-matrix-based fast-Fourier-transform (FFT) technique are applied to dense matrix equations from the mixed potential integral equation (MPIE) to enhance the computational efficiency of the CG-FFT algorithm. Numerical calculations show that the preconditioned CG-FFT algorithm with this preconditioner converges nearly 30 times as fast as the conventional one for the analysis of microstrip. Some typical microstrip discontinuities are analyzed and the good results demonstrate the validity of the proposed algorithm.

Research Area(s)

  • CG-FFT, Inexact preconditioning scheme, Integral-equation method, Microstrip circuits

Citation Format(s)