Improved recursive Green's function formalism for quasi one-dimensional systems with realistic defects
From MaRDI portal
(Redirected from Publication:1685276)
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.
Recommendations
- Green's functions on a renormalized lattice: an improved method for the integer quantum Hall transition
- Green's function approach to the impurity state in the Lieb lattice
- The Green's function in the problem of charge dynamics on a one-dimensional lattice with an impurity center
- The fractional nonlinear impurity: a Green function approach
- Continuum Dyson's equation and defect Green's function in a heterogeneous anisotropic solid
- Recursive Green's function method for multi-terminal nanostructures
- Exact calculation of the ground-state single-particle Green’s function for the 1/r2 quantum many-body system at integer coupling
- Exact Green's function for rectangular potentials and its application to quasi-bound states
- A real-space Green's function approach for disordered Hubbard model
- DIFFERENTIAL EQUATION APPROACH FOR ONE- AND TWO-DIMENSIONAL LATTICE GREEN'S FUNCTION
Cites work
- A fast algorithm for sparse matrix computations related to inversion
- A hybrid method for the parallel computation of Green's functions
- Methods of conjugate gradients for solving linear systems
- Nested Dissection of a Regular Finite Element Mesh
- Optimal block-tridiagonalization of matrices for coherent charge transport
- Quantum Transport: Atom to Transistor
- Recursive Green's function method for multi-terminal nanostructures
Cited in
(4)- Quantum transport in graphene nanoribbon networks: complexity reduction by a network decimation algorithm
- Electron quantum transport in disordered graphene
- Recursive Green's function method for multi-terminal nanostructures
- Green's functions on a renormalized lattice: an improved method for the integer quantum Hall transition
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)