Summary
A class of preconditioning methods depending on a relaxation parameter is presented for the solution of large linear systems of equationAx=b, whereA is a symmetric positive definite matrix. The methods are based on an incomplete factorization of the matrixA and include both pointwise and blockwise factorization. We study the dependence of the rate of convergence of the preconditioned conjugate gradient method on the distribution of eigenvalues ofC −1 A, whereC is the preconditioning matrix. We also show graphic representations of the eigenvalues and present numerical tests of the methods.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Andersson, L.: SSOR preconditioning of Toeplitz matrices. Thesis, Chalmers University of Technology, Göteborg, Sweden, 1976
Axelsson, O.: A class of iterative methods for finite element equations. Comput. Methods Appl. Mech. Eng.9, 123–137 (1976)
Axelsson, O.: A general incomplete block-matrix factorization method. Linear Algebra Appl. (To appear)
Axelsson, O., Barker, V.A.: Finite Element Solutions of Boundary Value Problems. Theory and Computation. New York: Academic Press 1984
Axelsson, O., Brinkkemper, S., Il'in, V.P.: On some versions of incomplete block-matrix factorization iterative methods. Linear Algebra Appl.58, 3–15 (1984)
Axelsson, O., Gustafsson, I.: Preconditioning and Two-Level Multigrid Methods of Arbitrary Degree of Approximation. Math. Comput.40, 219–242 (1983)
Axelsson, O., lindskog, G.: On the rate of convergence of the preconditioned conjugate gradient method. Numer. Math. (To appear)
Axelsson, O., Munksgaard, N.: A class of preconditioned conjugate gradient methods for the solution of a mixed finite element discretization of the biharmonic operator. Internat. J. Numer. Methods Eng.14, 1001–1019 (1979)
Beauwens, R.: On Axelssons perturbations. Linear Algebra Appl.68, 221–242 (1985)
Concus, P., Golub, G.H., Meurant, G.: Block preconditioning for the conjugate gradient method. SIAM J. Sci. Stat. Comput.6, 220–252 (1985)
Greenbaum, A.: Comparison of splittings used with the conjugate gradient algorithm. Numer. Math.33, 181–194 (1979)
Gustafsson, I.: Modified Incomplete Cholesky (MIC) Methods. In: Preconditioning Methods, Theory and Applications. (Evans, D.J., ed.), pp. 265–293. New York, London, Paris: Gordon and Breach Science 1983
Jennings, A.: Influence of the Eigenvalue, Spectrum on the Convergence Rate of the Conjugate Gradient Method. J. Inst. Math. Appl.20, 61–72 (1977)
Meijerink, J.A., van der Vorst, H.A.: An iterative solution method for linear systems of which the coefficient matrix is a symmetricM-matrix. Math. Comput.31, 148–152 (1977)
Varga, R.S.: Factorization and normalized iterative methods. In: Boundary problems in differential equations. (R.E. Langer, ed.), pp. 121–142. Madison: Madison University of Wisconsin Press 1960
van der Vorst, H.A., van der Sluis, A.: The rate of convergence of conjugate gradients. (Preprint Nr. 354, November 1984, Department of Mathematics University of Utrecht)
Winther, R.: Some superlinear convergence results for the conjugate gradient method. SIAM J. Numer. Anal.17, 14–17 (1980)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Axelsson, O., Lindskog, G. On the eigenvalue distribution of a class of preconditioning methods. Numer. Math. 48, 479–498 (1986). https://doi.org/10.1007/BF01389447
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01389447