Incomplete Cholesky factorization
In numerical analysis, an incomplete Cholesky factorization of a symmetric positive definite matrix is a sparse approximation of the Cholesky factorization. An incomplete Cholesky factorization is often used as a preconditioner for algorithms like the conjugate gradient method.
The Cholesky factorization of a positive definite matrix A of order N is A = LL* where L is a lower triangular matrix. An incomplete Cholesky factorization is given by a lower triangular matrix K that is sparser than L, but in some sense similar to L. The corresponding preconditioner is KK*.
There are many ways of constructing incomplete Cholesky factorizations. This article reviews two of them.