Nanoelectronic Modeling Lecture 21: Recursive Green Function Algorithm
Update: 2010-02-07
Description
The Recursive Green Function (RGF) algorithms is the primary workhorse for the numerical solution of NEGF equations in quasi-1D systems. It is particularly efficient in cases where the device is partitioned into reservoirs which may be characterized by a non-Hermitian Hamiltonian and a central device region which is Hermitian. Until now (2009) it also appears to be the only scalable algorithm that enables the rapid computation of incoherent transport with NEGF.
Comments
In Channel
Download from Google Play
Download from App Store
United States00:00
00:00
x
