PDF - Published Version (1MB) - Repository staff only | ||
| PDF - Submitted Version arXiv PDF (17.06.2008) (1MB) |
- URN to cite this document:
- urn:nbn:de:bvb:355-epub-78289
- DOI to cite this document:
- 10.5283/epub.7828
Abstract
Numerical quantum transport calculations are commonly based on a tight-binding formulation. A wide class of quantum transport algorithms requires 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 ...
Owner only: item control page