KIAM Main page Web Library  •  Publication Searh   

KIAM Preprint  13, Moscow, 2013
Authors: Kaporin I.E., Milyukova O. Y.
Optimization of the factorized preconditioners of conjugate gradient method for solving the linear algebraic systems with symmetric positive definite matrix
In the paper we consider the iterative solution of linear system Ax=b by the conjugate gradient method using the factorized preconditioner B=(I+LZ)Y(I+ZU), where A=D+L+U is the additive splitting of the coefficient matrix into the strictly lower triangular, the diagonal, and the strictly upper triangular parts. For an arbitrary symmetric positive definite matrix A, the diagonal matrices Y>0 and Z are constructed as the minimizers of a certain upper bound for the K-condition number of the inverse preconditioned matrix. The main advantages of the new method are as follows: wide range of applicability, low operation number count per iteration, good parallelizability for all the stages of computation, and sufficient reduction of the iteration number (for a properly chosen preconditioning parameters). Numerical results are given for several test problems.
onjugate gradient method, factorized preconditioner, the K-condition number.
Publication language: russian,  pages: 17
Research direction:
Mathematical problems and theory of numerical methods
Russian source text:
List of publications citation:
Export link to publication in format:   RIS    BibTeX
View statistics (updated once a day)
over the last 30 days 0 (-1), total hit from 01.09.2019 34
About authors:
  • Kaporin I.E.,  ,  ..
  • Milyukova Olga Yurievna, RAS