Nanoelectronic Modeling Lecture 21: Recursive Green Function Algorithm episode artwork

EPISODE · Feb 7, 2010

Nanoelectronic Modeling Lecture 21: Recursive Green Function Algorithm

from [Audio] Nanoelectronic Modeling: From Quantum Mechanics and Atoms to Realistic Devices · host Gerhard Klimeck

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.

Episode metadata supplied by the publisher feed · Published Feb 7, 2010

Embed this episode

NOW PLAYING

Nanoelectronic Modeling Lecture 21: Recursive Green Function Algorithm

0:00 0:00

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

No similar podcasts found.

Frequently Asked Questions

When was this [Audio] Nanoelectronic Modeling: From Quantum Mechanics and Atoms to Realistic Devices episode published?

This episode was published on February 7, 2010.

Can I download this [Audio] Nanoelectronic Modeling: From Quantum Mechanics and Atoms to Realistic Devices episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!