Abstract
In this paper, we construct new ω-circulant preconditioners for non-Hermitian Toeplitz systems, where we allow the generating function of the sequence of Toeplitz matrices to have zeros on the unit circle. We prove that the eigenvalues of the preconditioned normal equation are clustered at 1 and that for (N, N)-Toeplitz matrices with spectral condition number 𝒪(Nα) the corresponding PCG method requires at most scipt 𝒪(N log2 N) arithmetical operations. If the generating function of the Toeplitz sequence is a rational function then we show that our preconditioned original equation has only a fixed number of eigenvalues which are not equal to 1 such that preconditioned GMRES needs only a constant number of iteration steps independent of the dimension of the problem. Numerical tests are presented with PCG applied to the normal equation, GMRES, CGS and BICGSTAB. In particular, we apply our preconditioners to compute the stationary probability distribution vector of Markovian queuing models with batch arrival.
Original language | English |
---|---|
Pages (from-to) | 83-98 |
Number of pages | 16 |
Journal | Numerical Linear Algebra with Applications |
Volume | 8 |
Issue number | 2 |
Early online date | 9 Jan 2001 |
DOIs | |
Publication status | Published - Mar 2001 |
Externally published | Yes |
Keywords
- CG-method
- Circulant matrices
- Krylov space methods
- Non-Hermitian Toeplitz matrices
- Preconditioner