Equivalent sparse matrix reordering by elimination tree rotations
SIAM Journal on Scientific and Statistical Computing
A parallel graph partitioning algorithm for a message-passing multiprocessor
International Journal of Parallel Programming
The role of elimination trees in sparse factorization
SIAM Journal on Matrix Analysis and Applications
Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Parallel algorithms for sparse linear systems
SIAM Review
Block sparse Cholesky algorithms on advanced uniprocessor computers
SIAM Journal on Scientific Computing
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
ACM Transactions on Mathematical Software (TOMS)
Multifrontal algorithms for sparse inverse subsets and incomplete lu factorization
Multifrontal algorithms for sparse inverse subsets and incomplete lu factorization
Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)
Direct Methods for Sparse Linear Systems (Fundamentals of Algorithms 2)
Computing entries of the inverse of a sparse matrix using the FIND algorithm
Journal of Computational Physics
A hybrid method for the parallel computation of Green's functions
Journal of Computational Physics
SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix
ACM Transactions on Mathematical Software (TOMS)
A two-dimensional domain decomposition technique for the simulation of quantum-scale devices
Journal of Computational Physics
Hi-index | 31.45 |
We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of non-equilibrium Green's functions G^r and G^