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

R. S. Chen, K. F. Tsang, Edward K. N. Yung

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

7 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)120-125
JournalMicrowave and Optical Technology Letters
Volume35
Issue number2
DOIs
Publication statusPublished - 20 Oct 2002

Research Keywords

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

Fingerprint

Dive into the research topics of 'Sparse approximate inverse preconditioned CG-FFT algorithm with block Toeplitz matrix for fast analysis of microstrip circuits'. Together they form a unique fingerprint.

Cite this