×

An efficient conjugate gradient preconditioner for Toeplitz systems. (English) Zbl 0691.65016

The authors consider the conjugate gradient method for the solution of a system of linear equations with a possibly perturbed positive definite Toeplitz matrix T. They suggest a preconditioning matrix which arises naturally from the triangular decomposition of a characteristic submatrix of T. Some analysis of the presented method is given and its performance is tested numerically. The method is a variant of incomplete factorization methods.
Reviewer: Z.Dostal

MSC:

65F10 Iterative numerical methods for linear systems
Full Text: DOI

References:

[1] Axelsson, O.; Barker, A. V., Finite Element Methods for Boundary Value Problems (1984), Academic Press: Academic Press New York · Zbl 0537.65072
[2] Bultheel, A., Triangular decomposition of Toeplitz and related matrices: a guided tour in algorithmic aspects, Bull. Soc. Math. Belg. Sér A, 37, 101-141 (1985) · Zbl 0633.65025
[3] Chan, T. F., An optimal circulant preconditioner for Toeplitz systems, SIAM J. Sci. Statist. Comput., 9, 4, 766-771 (1988) · Zbl 0646.65042
[4] Chui, C. K.; Ward, J. D.; Smith, P. W., Cholesky factorization of positive definite bi-infinite matrices, Numer. Funct. Anal. Optim., 5, 1, 1-20 (1982) · Zbl 0503.15006
[5] Schäfer, E., Gaussian quadrature applied to eigenvalue approximations, (Hämmerlin, G., Numerical Integration. Numerical Integration, Internat. Ser. Numer. Anal., 57 (1982), Birkhäuser: Birkhäuser Basel), 187-197 · Zbl 0499.65061
[6] Strang, G., Introduction to Applied Mathematics (1986), Wellesley-Cambridge Press: Wellesley-Cambridge Press Wellesley · Zbl 0618.00015
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.