High quality preconditioning of a general symmetric positive definite matrix based on its U

A new matrix decomposition of the form A D U T U C U T R C R T U is proposed and investigated, where U is an upper triangular matrix (an approximation to the exact Cholesky factor U0), and R is a strictly upper triangular error matrix (with small elements and the fill-in limited by that of U0). For an arbitrary symmetric positive matrix A such a decomposition always exists and can be efficiently constructed; however it is not unique, and is determined by the choice of an involved truncation rule. An analysis of both spectral and Kcondition numbers is given for the preconditioned matrix M D U T AU 1 and a comparison is made with the RIC preconditioning proposed by Ajiz and Jennings. A concept of approximation order of an incomplete factorization is introduced and it is shown that RIC is the first order method, whereas the proposed method is of second order. The idea underlying the proposed method is also applicable to the analysis of CGNE-type methods for general non-singular matrices and approximate LU factorizations of non-symmetric positive definite matrices. Practical use of the preconditioning techniques developed is discussed and illustrated by an extensive set of numerical examples. © 1998 John Wiley & Sons, Ltd.

[1]  Yousef Saad,et al.  ILUT: A dual threshold incomplete LU factorization , 1994, Numer. Linear Algebra Appl..

[2]  M. Tismenetsky,et al.  A new preconditioning technique for solving large sparse linear systems , 1991 .

[3]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[4]  O. Axelsson.  Iterative solution methods , 1995 .

[5]  Igor E. Kaporin,et al.  Block SSOR preconditionings for high-order 3D FE systems. II. Incomplete BSSOR preconditionings , 1991 .

[6]  Owe Axelsson,et al.  Bounds of Eigenvalues of Preconditioned Matrices , 1992, SIAM J. Matrix Anal. Appl..

[7]  M. A. Ajiz,et al.  A robust incomplete Choleski‐conjugate gradient algorithm , 1984 .

[8]  Xin Yao,et al.  Simulated annealing with extended neighbourhood , 1991, Int. J. Comput. Math..

[9]  D. Kershaw.  The incomplete Cholesky—conjugate gradient method for the iterative solution of systems of linear equations , 1978 .

[10]  A. Jennings,et al.  An iterative method for large systems of linear structural equations , 1973 .

[11]  Yvan Notay,et al.  On the convergence rate of the conjugate gradients in presence of rounding errors , 1993 .

[12]  Igor E. Kaporin,et al.  Explicitly preconditioned conjugate gradient method for the solution of unsymmetric linear systems , 1992 .

[13]  N. Munksgaard,et al.  Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients , 1980, TOMS.

[14]  Mark T. Jones,et al.  An improved incomplete Cholesky factorization , 1995, TOMS.

[15]  T. Manteuffel.  An incomplete factorization technique for positive definite linear systems , 1980 .

[16]  O. Axelsson.  A class of iterative methods for finite element equations , 1976 .

[17]  Igor E. Kaporin,et al.  New convergence results and preconditioning strategies for the conjugate gradient method , 1994, Numer. Linear Algebra Appl..