Computer Science Technical Reports
CS at VT

Sparse Approximate Inverses in Preconditioning Distributed Linear Systems

Authors UNSPECIFIED (1997) Sparse Approximate Inverses in Preconditioning Distributed Linear Systems. Technical Report ncstrl.vatech_cs//TR-97-11, Computer Science, Virginia Polytechnic Institute and State University.

Full text available as:
Postscript - Requires a viewer, such as GhostView (129156)


Using a direct approximation of sparse matrix inverse in preconditioning is viewed as a good alternative to the preconditioning techniques that require a matrix factorization. A sparse approximate inverse is easy to compute and apply, and it is suitable for parallel implementations. For distributed linear systems of varying difficulty, approximate block LU preconditioning using sparse approximate inverse techniques and an incomplete LU factorization used in Block-Jacobi preconditioning are compared.

Item Type:Departmental Technical Report
Subjects:Computer Science > Historical Collection(Till Dec 2001)
ID Code:468
Deposited By:User autouser
Deposited On:05 December 2001
Alternative Locations: URL:, URL: