A Sparse-Sparse Iteration for Computing a Sparse Incomplete Factorization of the Inverse of an SPD Matrix

Details A Sparse-Sparse Iteration for Computing a Sparse Incomplete Factorization of the Inverse of an SPD Matrix A Sparse-Sparse Iteration for Computing a Sparse Incomplete Factorization of the Inverse of an SPD Matrix

2008-07-23

arxiv.org/abs/0807.3644v1

Mathematics

Numerical Analysis

15 pages, 1 figure

Scientific paper

10.1016/j.apnum.2008.07.002

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.

Affiliated with

Also associated with

No associations

Rating

A Sparse-Sparse Iteration for Computing a Sparse Incomplete Factorization of the Inverse of an SPD Matrix does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Sparse-Sparse Iteration for Computing a Sparse Incomplete Factorization of the Inverse of an SPD Matrix, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Sparse-Sparse Iteration for Computing a Sparse Incomplete Factorization of the Inverse of an SPD Matrix will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-837