Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions

The FIND algorithm is a fast algorithm designed to calculate certain entries of the inverse of a sparse matrix. Such calculation is critical in many applications, e.g., quantum transport in nano-devices. We extended the algorithm to other matrix inverse related calculations. Those are required for example to calculate the less-than Green's function and the current density through the device. For a 2D device discretized as an N"xxN"y mesh, the best known algorithms have a running time of O(N"x^3N"y), whereas FIND only requires O(N"x^2N"y). Even though this complexity has been reduced by an order of magnitude, the matrix inverse calculation is still the most time consuming part in the simulation of transport problems. We could not reduce the order of complexity, but we were able to significantly reduce the constant factor involved in the computation cost. By exploiting the sparsity and symmetry, the size of the problem beyond which FIND is faster than other methods typically decreases from a 130x130 2D mesh down to a 40x40 mesh. These improvements make the optimized FIND algorithm even more competitive for real-life applications.

[1]  D. Vasileska,et al.  Quantum Transport Simulation of Experimentally Fabricated Nano-FinFET , 2007, IEEE Transactions on Electron Devices.

[2]  Per Christian Hansen,et al.  Block tridiagonal matrix inversion and fast transmission calculations , 2008, J. Comput. Phys..

[3]  Yousef Saad,et al.  A Probing Method for Computing the Diagonal of the Matrix Inverse ∗ , 2010 .

[4]  Mark A. Ratner,et al.  Molecular electronics , 2005 .

[5]  U. Trottenberg,et al.  Multigrid Software for Industrial Applications - From MG00 to SAMG , 2009 .

[6]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[7]  Eric Darve,et al.  A hybrid method for the parallel computation of Green's functions , 2009, J. Comput. Phys..

[8]  W. F. Tinney,et al.  On computing certain elements of the inverse of a sparse matrix , 1975, Commun. ACM.

[9]  E. Weinan,et al.  Fast algorithm for extracting the diagonal of the inverse matrix with application to the electronic structure analysis of metallic systems , 2009 .

[10]  Avik W. Ghosh,et al.  Molecular Electronics: Theory and Device Prospects , 2004 .

[11]  Alle-Jan van der Veen,et al.  Some Fast Algorithms for Sequentially Semiseparable Representations , 2005, SIAM J. Matrix Anal. Appl..

[12]  Shivkumar Chandrasekaran,et al.  A Fast Solver for HSS Representations via Sparse Matrices , 2006, SIAM J. Matrix Anal. Appl..

[13]  D. Vasileska,et al.  Contact block reduction method and its application to a 10 nm MOSFET device , 2004 .

[14]  Gerhard Klimeck,et al.  Single and multiband modeling of quantum electron transport through layered semiconductor devices , 1997 .

[15]  A. Asenov,et al.  A Self-Consistent Full 3-D Real-Space NEGF Simulator for Studying Nonperturbative Effects in Nano-MOSFETs , 2007, IEEE Transactions on Electron Devices.

[16]  Shivkumar Chandrasekaran,et al.  A Fast ULV Decomposition Solver for Hierarchically Semiseparable Representations , 2006, SIAM J. Matrix Anal. Appl..

[17]  W. Hackbusch.  A Sparse Matrix Arithmetic Based on $\Cal H$-Matrices. Part I: Introduction to ${\Cal H}$-Matrices , 1999, Computing.

[18]  J. Fattebert,et al.  Towards grid-based OÑNÖ density-functional theory methods: Optimized nonorthogonal orbitals and multigrid acceleration , 2000 .

[19]  Lexing Ying,et al.  SelInv---An Algorithm for Selected Inversion of a Sparse Symmetric Matrix , 2011, TOMS.

[20]  Achi Brandt.  General Highly Accurate Algebraic Coarsening Schemes , 1999 .

[21]  John R. Gilbert,et al.  A parallel graph partitioning algorithm for a message-passing multiprocessor , 1987, International Journal of Parallel Programming.

[22]  A. George.  Nested Dissection of a Regular Finite Element Mesh , 1973 .

[23]  Eric Darve,et al.  Calculating transport properties of nanodevices , 2004, SPIE Optics East.

[24]  J. Bernholc,et al.  Recent developments and applications of the real-space multigrid method , 2008 .

[25]  Gene H. Golub,et al.  Matrix computations , 1983 .

[26]  Wolfgang Hackbusch,et al.  A Sparse Matrix Arithmetic Based on H-Matrices. Part I: Introduction to H-Matrices , 1999, Computing.

[27]  W. Hackbusch,et al.  Introduction to Hierarchical Matrices with Applications , 2003 .

[28]  J. Bunch,et al.  Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations , 1971 .

[29]  Eric Darve,et al.  Computing entries of the inverse of a sparse matrix using the FIND algorithm , 2008, J. Comput. Phys..

[30]  D. Vasileska,et al.  Electron Density Calculation Using the Contact Block Reduction Method , 2004 .

[31]  P. Vogl,et al.  Ballistic quantum transport using the contact block reduction (CBR) method , 2009 .

[32]  T. Beck,et al.  Nonlinear multigrid eigenvalue solver utilizing nonorthogonal localized orbitals , 2006 .

[33]  J. Bunch,et al.  Some stable methods for calculating inertia and solving symmetric linear systems , 1977 .

[34]  M. Anantram,et al.  Two-dimensional quantum mechanical modeling of nanotransistors , 2001, cond-mat/0111290.

[35]  Fast inverse using nested dissection for NEGF , 2007 .

[36]  P. Vogl,et al.  Efficient method for the calculation of ballistic quantum transport , 2003 .

[37]  Thomas L. Beck,et al.  Efficient multiscale algorithms for solution of self-consistent eigenvalue problems in real space , 2007 .

[38]  A. George,et al.  On Row and Column Orderings for Sparse Least Squares Problems , 1983 .

[39]  Michael T. Heath,et al.  Parallel Algorithms for Sparse Linear Systems , 1991, SIAM Rev..