The effect of incomplete decomposition preconditioning on the convergence of Conjugate Gradients
The ICCG method, for the iterative solution of the large sparse linear system Ax = b (A is symmetric positive definite) consists of the preconditioning of the system, using an incomplete Choleski decomposition K of the matrix A, and the subsequent iterative solution of this system by the conjugate gradients method. For the construction of an incomplete Choleski decomposition it is, in addition, desirable that A be an M-matrix (see, e.g., ).
Unable to display preview. Download preview PDF.
- O.Axelsson.Solution of linear systems of equations:iterative methods.In V.A.Barker,editor,Sparse Matrix Techniques,Copenhagen 1976,Springer Verlag,Berlin,1977.Google Scholar
- P.Concus,G.H.Golub,and D.P.O’Leary.A generalized conjugate gradient method for the numerical solution of elliptic partial differential equations.In J.R.Bunch and D.J.Rose,editors,Sparse Matrix Computations,Academic Press,New York,1976.Google Scholar
- H.A.van der Vorst.Preconditioning by Incomplete Decompositions.PhD Thesis,Utrecht University,1982.Google Scholar
- R.S.Varga.Matrix Iterative Analysis.Prentice-Hall,Englewood Cliffs N.J.,1962.Google Scholar