2018
DOI: 10.21468/scipostphys.4.5.026
|View full text |Cite
|
Sign up to set email alerts
|

A general algorithm for computing bound states in infinite tight-binding systems

Abstract: We propose a robust and efficient algorithm for computing bound states of infinite tightbinding systems that are made up of a finite scattering region connected to semi-infinite leads. Our method uses wave matching in close analogy to the approaches used to obtain propagating states and scattering matrices. We show that our algorithm is robust in presence of slowly decaying bound states where a diagonalization of a finite system would fail. It also allows to calculate the bound states that can be present in th… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 18 publications
(15 citation statements)
references
References 28 publications
(29 reference statements)
0
15
0
Order By: Relevance
“…Finally one mentions that Istas, Groth and Waintal have recently proposed an approach to cope with "mostly translationally invariant systems" (Istas et al, 2018), i.e., systems with weak disorder. With this method, systems of complex geometries are decomposed into two parts; one fully periodic part that is stitched with another part containing the disorder potential and electrodes.…”
Section: Landauer-b üTtiker Quantum Transport Methodologymentioning
confidence: 99%
“…Finally one mentions that Istas, Groth and Waintal have recently proposed an approach to cope with "mostly translationally invariant systems" (Istas et al, 2018), i.e., systems with weak disorder. With this method, systems of complex geometries are decomposed into two parts; one fully periodic part that is stitched with another part containing the disorder potential and electrodes.…”
Section: Landauer-b üTtiker Quantum Transport Methodologymentioning
confidence: 99%
“…A global solution needs to be continuous at x = 0, and it exists if there is a nonzero linear combination of the left mode vectors ψ i L that is also a linear combination of right mode vectors ψ i R . We therefore obtain the edge spectrum by numerically finding points in the (E, k) plane where W is singular [25].…”
Section: Gapless Domain Wall Modesmentioning
confidence: 99%
“…We use the bound state algorithm developed in Ref. 20 to address this problem. Altogether, our MTIS algorithm consists of a non-trivial combination of the residue solver, the numerical Fourier transform solver, the glueing sequence solver and the bound state solver.…”
Section: B Principle Of the Techniquementioning
confidence: 99%
“…We have devoted an earlier article to this problem to which we refer for all technical details. 20 We suppose that we have computed the energy E α (k y , k z ) and the associated state ψ α (x, k y , k z ) of the semi-infinite problem. Once this is done, we numerically inverse the function E α (k y , k z ) to obtain k α =k y (E, k z ).…”
Section: The Bound State Problemmentioning
confidence: 99%
See 1 more Smart Citation