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

Parallel implementation of the recursive Green’s function method

Abstract: A parallel algorithm for the implementation of the recursive Green's function technique, which is extensively applied in the coherent scattering formalism, is developed. The algorithm performs a domain decomposition of the scattering region among the processors participating in the computation and calculates the Schur's complement block in the form of distributed blocks among the processors. If the method is applied recursively, thereby eliminating the processors cyclically, it is possible to arrive at a Schur… 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
36
0

Year Published

2008
2008
2017
2017

Publication Types

Select...
7
3

Relationship

0
10

Authors

Journals

citations
Cited by 29 publications
(36 citation statements)
references
References 19 publications
(21 reference statements)
0
36
0
Order By: Relevance
“…From this GF both transport and local properties can be obtained. However, for most purposes we do not require every element of the GF matrix element in the device region, and so to avoid a timeconsuming, full-matrix inversion, various recursive or other decomposition methods are often applied [9,14,20,[25][26][27][28][29][30][31][32].…”
Section: Adaptive Recursion For Device Regionmentioning
confidence: 99%
“…From this GF both transport and local properties can be obtained. However, for most purposes we do not require every element of the GF matrix element in the device region, and so to avoid a timeconsuming, full-matrix inversion, various recursive or other decomposition methods are often applied [9,14,20,[25][26][27][28][29][30][31][32].…”
Section: Adaptive Recursion For Device Regionmentioning
confidence: 99%
“…It has also been adapted to Hall geometries with four terminals [30] and to calculate nonequilibrium densities [31,32]. Furthermore, the RGF algorithm has been formulated to be suitable for parallel computing [33].…”
Section: Introductionmentioning
confidence: 99%
“…We again reiterate that this procedure is exact; no approximations or truncations have been performed at any stage of the computation. Recursive techniques such as this, which make use of the sparsity of the Hamiltonian matrix, are very widely used in the quantum transport community to compute Green's functions [54][55][56][57][58][59].…”
Section: A Green's Functions and The Local Density Of Statesmentioning
confidence: 99%