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

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

doi:10.1002/mop.10459

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

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

Department of Electrical Engineering

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

11 Citations (Scopus)

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.

Original language	English
Pages (from-to)	347-351
Journal	Microwave and Optical Technology Letters
Volume	34
Issue number	5
DOIs	https://doi.org/10.1002/mop.10459
Publication status	Published - 5 Sept 2002

Research Keywords

CG-FFT
Inexact preconditioning scheme
Integral-equation method
Microstrip circuits

Access Output

10.1002/mop.10459

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{2ba2c8191f5d42f7956346505f6543fe,

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

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.",

keywords = "CG-FFT, Inexact preconditioning scheme, Integral-equation method, Microstrip circuits",

author = "Chen, {R. S.} and Yung, {Edward K. N.} and Tsang, {K. F.} and L. Mo",

year = "2002",

month = sep,

day = "5",

doi = "10.1002/mop.10459",

language = "English",

volume = "34",

pages = "347--351",

journal = "Microwave and Optical Technology Letters",

issn = "0895-2477",

publisher = "John Wiley & Sons",

number = "5",

}

The block-Toeplitz-matrix-based CG-FFT algorithm with an inexact sparse preconditioner for analysis of microstrip circuits. / Chen, R. S.; Yung, Edward K. N.; Tsang, K. F. et al.
In: Microwave and Optical Technology Letters, Vol. 34, No. 5, 05.09.2002, p. 347-351.

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

TY - JOUR

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

AU - Chen, R. S.

AU - Yung, Edward K. N.

AU - Tsang, K. F.

AU - Mo, L.

PY - 2002/9/5

Y1 - 2002/9/5

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

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

KW - CG-FFT

KW - Inexact preconditioning scheme

KW - Integral-equation method

KW - Microstrip circuits

UR - http://www.scopus.com/inward/record.url?scp=0037026376&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-0037026376&origin=recordpage

U2 - 10.1002/mop.10459

DO - 10.1002/mop.10459

M3 - RGC 21 - Publication in refereed journal

SN - 0895-2477

VL - 34

SP - 347

EP - 351

JO - Microwave and Optical Technology Letters

JF - Microwave and Optical Technology Letters

IS - 5

ER -

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

Abstract

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this