A Sparse-Sparse Iteration for Computing a Sparse Incomplete Factorization of the Inverse of an SPD Matrix
For researchers solving SPD linear systems, this offers an alternative preconditioner that may be more efficient in certain cases, though the improvement is incremental.
The paper proposes a sparse-sparse iteration method for computing a sparse incomplete factorization of the inverse of an SPD matrix, used as a preconditioner for PCG. Numerical experiments on Harwell-Boeing matrices show it is competitive with a well-known algorithm.
In this paper, a method via sparse-sparse iteration for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix is proposed. The resulting factorized sparse approximate inverse is used as a preconditioner for solving symmetric positive definite linear systems of equations by using the preconditioned conjugate gradient algorithm. Some numerical experiments on test matrices from the Harwell-Boeing collection for comparing the numerical performance of the presented method with one available well-known algorithm are also given.