Premium
The block‐Toeplitz‐matrix based CG‐FFT algorithm with an inexact sparse preconditioner for analysis of microstrip circuits
Author(s) -
Chen R. S.,
Yung Edward K. N.,
Tsang K. F.,
Mo L.
Publication year - 2002
Publication title -
microwave and optical technology letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.304
H-Index - 76
eISSN - 1098-2760
pISSN - 0895-2477
DOI - 10.1002/mop.10459
Subject(s) - preconditioner , toeplitz matrix , fast fourier transform , conjugate gradient method , algorithm , matrix (chemical analysis) , mathematics , block (permutation group theory) , computer science , iterative method , geometry , materials science , pure mathematics , composite material
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. © 2002 Wiley Periodicals, Inc. Microwave Opt Technol Lett 34: 347–351, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.10459