SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix
Publication
, Journal Article
Lin, L; Yang, C; Meza, JC; Lu, J; Ying, L; E, W
Published in: ACM Transactions on Mathematical Software
We describe an efficient implementation of an algorithm for computing selected elements of a general sparse symmetric matrix
that can be decomposed as
=
, where
is lower triangular and
is diagonal. Our implementation, which is called
, is built on top of an efficient supernodal left-looking
factorization of
. We discuss how computational efficiency can be gained by making use of a relative index array to handle indirect addressing. We report the performance of SelInv on a collection of sparse matrices of various sizes and nonzero structures. We also demonstrate how SelInv can be used in electronic structure calculations.
Altmetric Attention Stats
Dimensions Citation Stats
