SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix

Journal Article

We describe an efficient implementation of an algorithm for computing selected elements of a general sparse symmetric matrix A that can be decomposed as A = LDLT , where L is lower triangular and D is diagonal. Our implementation, which is called SelInv , is built on top of an efficient supernodal left-looking LDLT factorization of A . 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.

Full Text

Duke Authors

Cited Authors

  • Lin, L; Yang, C; Meza, JC; Lu, J; Ying, L; E, W

Published Date

  • February 2011

Published In

Volume / Issue

  • 37 / 4

Start / End Page

  • 1 - 19

Published By

Electronic International Standard Serial Number (EISSN)

  • 1557-7295

International Standard Serial Number (ISSN)

  • 0098-3500

Digital Object Identifier (DOI)

  • 10.1145/1916461.1916464


  • en