Premium
Sparse approximate inverse preconditioned CG‐FFT algorithm with block toeplitz matrix for fast analysis of microstrip circuits
Author(s) -
Chen R. S.,
Tsang K. F.,
Yung Edward K. N.
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.10534
Subject(s) - toeplitz matrix , fast fourier transform , preconditioner , conjugate gradient method , algorithm , matrix (chemical analysis) , mathematics , inverse , block (permutation group theory) , sparse matrix , computer science , iterative method , physics , geometry , materials science , pure mathematics , composite material , quantum mechanics , gaussian
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: 120–125, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.10534