Improved recursive Green's function formalism for quasi one-dimensional systems with realistic defects

From MaRDI portal
Publication:1685276

DOI10.1016/J.JCP.2017.01.024zbMATH Open1375.81093arXiv1705.02178OpenAlexW2579765447MaRDI QIDQ1685276FDOQ1685276


Authors: Peng Zhang Edit this on Wikidata


Publication date: 13 December 2017

Published in: Journal of Computational Physics (Search for Journal in Brave)

Abstract: We derive an improved version of the recursive Green's function formalism (RGF), which is a standard tool in the quantum transport theory. We consider the case of disordered quasi one-dimensional materials where the disorder is applied in form of randomly distributed realistic defects, leading to partly periodic Hamiltonian matrices. The algorithm accelerates the common RGF in the recursive decimation scheme, using the iteration steps of the renormalization decimation algorithm. This leads to a smaller effective system, which is treated using the common forward iteration scheme. The computational complexity scales linearly with the number of defects, instead of linearly with the total system length for the conventional approach. We show that the scaling of the calculation time of the Green's function depends on the defect density of a random test system. Furthermore, we discuss the calculation time and the memory requirement of the whole transport formalism applied to defective carbon nanotubes.


Full work available at URL: https://arxiv.org/abs/1705.02178




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: Improved recursive Green's function formalism for quasi one-dimensional systems with realistic defects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1685276)