✦ LIBER ✦

The block-Toeplitz-matrix based CG-FFT algorithm with an inexact sparse preconditioner for analysis of microstrip circuits

✍ Scribed by R. S. Chen; Edward K. N. Yung; K. F. Tsang; L. Mo

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 116 KB
Volume: 34
Category: Article
ISSN: 0895-2477
DOI: 10.1002/mop.10459

No coin nor oath required. For personal study only.

✦ Synopsis

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 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

📜 SIMILAR VOLUMES

Sparse approximate inverse preconditione

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 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB

## 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