TY - JOUR
T1 - The Best Circulant Preconditioners for Hermitian Toeplitz Systems
AU - Chan, Raymond H.
AU - Yip, Andy M.
AU - Ng, Michael K.
N1 - Department of Mathematics, The Chinese Universityof Hong Kong, Shatin, Hong Kong ([email protected]). The research of this author was supported in part by Hong Kong Research Grants Council grant CUHK 4207/97P and CUHK DAG grant 2060143.
Department of Mathematics, The Universityof Hong Kong, Pokfulam Road, Hong Kong ([email protected], [email protected]). The research of the third author was supported in part by HKU 7147/99P and HKU CRCG grants 10201939 and 10202720.
Publisher Copyright:
© 2000 Society for Industrial and Applied Mathematics.
PY - 2000/1
Y1 - 2000/1
N2 - In this paper, we propose a new family of circulant preconditions for ill-conditioned Hermitian Toeplitz systems Ax = b. The preconditioners are constructed by convolving the generating function f of A with the generalized Jackson kernels. For an n-by-n Toeplitz matrix A, the construction of the preconditioners requires only the entries of A and does not require the explicit knowledge of f. When f is a nonnegative continuous function with a zero of order 2p, the condition number of A is known to grow as O(n2p). We show, however, that our preconditoner is positive definite and the spectrum of the preconditioned matrix is uniformly bounded except for at most 2p + 1 outliers. Moreover, the smallest eigenvalue is uniformly bounded away from zero. Hence the conjugate gradient method, when applied to solving the preconditioned system converges linearly. The total complexity of solving the system is therefore of O(n log n) operation. In the case when f is positive, we show that the convergence is superlinear. Numerical results are included to illustrate the effectiveness of our new circulant preconditioners.
AB - In this paper, we propose a new family of circulant preconditions for ill-conditioned Hermitian Toeplitz systems Ax = b. The preconditioners are constructed by convolving the generating function f of A with the generalized Jackson kernels. For an n-by-n Toeplitz matrix A, the construction of the preconditioners requires only the entries of A and does not require the explicit knowledge of f. When f is a nonnegative continuous function with a zero of order 2p, the condition number of A is known to grow as O(n2p). We show, however, that our preconditoner is positive definite and the spectrum of the preconditioned matrix is uniformly bounded except for at most 2p + 1 outliers. Moreover, the smallest eigenvalue is uniformly bounded away from zero. Hence the conjugate gradient method, when applied to solving the preconditioned system converges linearly. The total complexity of solving the system is therefore of O(n log n) operation. In the case when f is positive, we show that the convergence is superlinear. Numerical results are included to illustrate the effectiveness of our new circulant preconditioners.
KW - Toeplitz systems
KW - circulant preconditioner
KW - kernel functions
KW - preconditioned conjugate gradient method
UR - http://www.scopus.com/inward/record.url?scp=0034437059&partnerID=8YFLogxK
U2 - 10.1137/S0036142999354083
DO - 10.1137/S0036142999354083
M3 - Journal article
AN - SCOPUS:0034437059
SN - 0036-1429
VL - 38
SP - 876
EP - 896
JO - SIAM Journal on Numerical Analysis
JF - SIAM Journal on Numerical Analysis
IS - 3
ER -