Association for Computing Machinery
The authors describe an efficient parallel implementation of the selected inversion algorithm for distributed memory computer systems, which they call PSelInv. The PSelInv method computes selected elements of a general sparse matrix A that can be decomposed as A = LU, where L is lower triangular and U is upper triangular. The implementation described in this paper focuses on the case of sparse symmetric matrices. It contains an interface that is compatible with the distributed memory parallel sparse direct factorization SuperLU DIST. However, the underlying data structure and design of PSelInv allows it to be easily combined with other factorization routines such as PARDISO.