Optimal block-tridiagonalization of matrices for coherent charge transport
Numerical quantum transport calculations are commonly based on a tight-binding formulation. A wide class of quantum transport algorithms require the tight-binding Hamiltonian to be in the form of a block-tridiagonal matrix. Here, we develop a matrix reordering algorithm based on graph partitioning t...
        Saved in:
      
    
          | Published in | Journal of computational physics Vol. 228; no. 23; pp. 8548 - 8565 | 
|---|---|
| Main Authors | , | 
| Format | Journal Article | 
| Language | English | 
| Published | 
        Kidlington
          Elsevier Inc
    
        10.12.2009
     Elsevier  | 
| Subjects | |
| Online Access | Get full text | 
| ISSN | 0021-9991 1090-2716  | 
| DOI | 10.1016/j.jcp.2009.08.001 | 
Cover
| Summary: | Numerical quantum transport calculations are commonly based on a tight-binding formulation. A wide class of quantum transport algorithms require the tight-binding Hamiltonian to be in the form of a block-tridiagonal matrix. Here, we develop a matrix reordering algorithm based on graph partitioning techniques that yields the optimal block-tridiagonal form for quantum transport. The reordered Hamiltonian can lead to significant performance gains in transport calculations, and allows to apply conventional two-terminal algorithms to arbitrarily complex geometries, including multi-terminal structures. The block-tridiagonalization algorithm can thus be the foundation for a generic quantum transport code, applicable to arbitrary tight-binding systems. We demonstrate the power of this approach by applying the block-tridiagonalization algorithm together with the recursive Green’s function algorithm to various examples of mesoscopic transport in two-dimensional electron gases in semiconductors and graphene. | 
|---|---|
| Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23  | 
| ISSN: | 0021-9991 1090-2716  | 
| DOI: | 10.1016/j.jcp.2009.08.001 |