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

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.

References in corpus (6)

• A knitting algorithm for calculating Green functions in quantum systems
• Linear Algebraic Calculation of Green's function for Large-Scale Electronic Structure Theory
• Ab initio study of transport properties in defected carbon nanotubes: an O(N) approach
• Improved recursive Green's function formalism for quasi one-dimensional systems with realistic defects
• Strong localization in defective carbon nanotubes: a recursive Green's function study
• Interaction between carbon nanotubes and metals: Electronic properties, stability, and sensing

Cited by in corpus (5)

• Improved recursive Green's function formalism for quasi one-dimensional systems with realistic defects
• 2D topological matter from a boundary Green's functions perspective: Faddeev-LeVerrier algorithm implementation
• Electronic transport through defective semiconducting carbon nanotubes
• Quantum transport in graphene nanoribbon networks: complexity reduction by a network decimation algorithm
• Introducing Open boundary conditions in modeling nonperiodic materials and interfaces: the impact of the periodic assumption