## Abstract In this paper, the wavelet transform technique is used to transform dense matrix equations from the mixed potential integral equation (MPIE) to obtain sparse matrix equations, after dropping elements smaller than the threshold. The multifrontal method is employed to solve the resultant
Sparse approximate inverse preconditioned CG-FFT algorithm with block toeplitz matrix for fast analysis of microstrip circuits
✍ Scribed by R. S. Chen; K. F. Tsang; Edward K. N. Yung
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 154 KB
- Volume
- 35
- Category
- Article
- ISSN
- 0895-2477
No coin nor oath required. For personal study only.
✦ Synopsis
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: 120–125, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/mop.10534
📜 SIMILAR VOLUMES
## 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 comp