On computing certain elements of the inverse of a sparse matrix
Communications of the ACM
Computing entries of the inverse of a sparse matrix using the FIND algorithm
Journal of Computational Physics
SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix
ACM Transactions on Mathematical Software (TOMS)
Atomistic nanoelectronic device engineering with sustained performances up to 1.44 PFlop/s
Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
SIAM Journal on Scientific Computing
Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions
Journal of Computational Physics
A fast algorithm for sparse matrix computations related to inversion
Journal of Computational Physics
Patchwork algorithm for the parallel computation of the Green's function in open systems
Journal of Computational Electronics
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Hi-index | 31.46 |
Quantum transport models for nanodevices using the non-equilibrium Green's function method require the repeated calculation of the block tridiagonal part of the Green's and lesser Green's function matrices. This problem is related to the calculation of the inverse of a sparse matrix. Because of the large number of times this calculation needs to be performed, this is computationally very expensive even on supercomputers. The classical approach is based on recurrence formulas which cannot be efficiently parallelized. This practically prevents the solution of large problems with hundreds of thousands of atoms. We propose new recurrences for a general class of sparse matrices to calculate Green's and lesser Green's function matrices which extend formulas derived by Takahashi and others. We show that these recurrences may lead to a dramatically reduced computational cost because they only require computing a small number of entries of the inverse matrix. Then, we propose a parallelization strategy for block tridiagonal matrices which involves a combination of Schur complement calculations and cyclic reduction. It achieves good scalability even on problems of modest size.