2019
DOI: 10.1016/j.jcp.2019.05.034
|View full text |Cite
|
Sign up to set email alerts
|

An order N numerical method to efficiently calculate the transport properties of large systems: An algorithm optimized for sparse linear solvers

Abstract: We present a self-contained description of the wave-function matching (WFM) method to calculate electronic quantum transport properties of nanostructures using the Landauer-Büttiker approach. The method is based on a partition of the system between a central region ("conductor") containing N S sites and an asymptotic region ("leads") characterized by N P open channels. The two subsystems are linearly coupled and solved simultaneously using an efficient sparse linear solver. Invoking the sparsity of the Hamilto… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 13 publications
(5 citation statements)
references
References 50 publications
0
5
0
Order By: Relevance
“…This approach is at the root of the numerical package t-Kwant, 28 which extends to the time domain the quantum transport package Kwant. [88][89][90] To date, t-Kwant has been used for calculating time resolved particle density and particle current in various systems. 29,30,32,33,91,92 The case of particle current noise has also been dealt with in Ref.…”
Section: Methodsmentioning
confidence: 99%
“…This approach is at the root of the numerical package t-Kwant, 28 which extends to the time domain the quantum transport package Kwant. [88][89][90] To date, t-Kwant has been used for calculating time resolved particle density and particle current in various systems. 29,30,32,33,91,92 The case of particle current noise has also been dealt with in Ref.…”
Section: Methodsmentioning
confidence: 99%
“…Then the scaling of the computational time goes as aLW + bLW 2 . Consequently, for fixed W, the divideand-conquer algorithm is linear in L, which is on par with the other recursive methods [16][17][18]. On the other hand, if L W then the computational time goes as aLW + bL 2 W, which is linear in W. Figure 4(a) presents the computational time for systems shown in the inset with W L (red squares) and L W (blue circles).…”
Section: Performance Of the Divide-and-conquer Algorithmmentioning
confidence: 96%
“…The transmission function depends strongly on the presence of impurities and defects, the geometry, and the lattice of the systems. Realistic systems consist of a large number of sites, therefore computational efficiency is an essential part of the recursive methods [16,17]. The transfer matrix can be found by multiplying transfer matrices of slices of the system.…”
Section: Introductionmentioning
confidence: 99%
“…Santos et al used a graphene Hall bar to introduce a novel self-contained description of the wave-function matching method to calculate electronic quantum transport properties of nanostructures using the Landauer-Büttiker approach [245]. The method is based on partitioning the system-to-besolved into a central conductor and an asymptotic region for the leads.…”
Section: D Materialsmentioning
confidence: 99%