Sparse approximate inverse preconditioned CG-FFT algorithm with block Toeplitz matrix for fast analysis of microstrip circuits

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

7 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)120-125
Journal / PublicationMicrowave and Optical Technology Letters
Volume35
Issue number2
Publication statusPublished - 20 Oct 2002

Abstract

In this paper, the multifrontal method is employed to precondition the conjugate gradient (CG) algorithm with the block Toeplitz matrix based fast Fourier transform (FFT) technique for dense matrix equations from the mixed potential integral equation (MPIE) to enhance the computational efficiency of the CG-FFT algorithm. Our numerical calculations show that the preconditioned CG-FFT algorithm with this Sparse Approximate Inverse preconditioner can converge hundreds of times faster than 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. © 2002 Wiley Periodicals, Inc. Microwave Opt Technol Lett 35.

Research Area(s)

  • CG-FFT, Integral equation method, Microstrip circuits, Multifrontal method, Sparse approximate inverse preconditioner

Citation Format(s)