Computing entries of the inverse of a sparse matrix using the FIND algorithm

S Li, Institute for Computational and Mathematical Engineering, Stanford University
Gerhard Klimeck, Birck Nanotechnology Center, Purdue University
E Darve, Institute for Computational and Mathematical Engineering, Stanford University

Date of this Version

11-20-2008

Citation

Journal of Computational Physics 227 (2008) 9408–9427

This document has been peer-reviewed.

 

Abstract

An accurate and efficient algorithm, called fast inverse using nested dissection (FIND). for computing non-equilibrium Green's functions (NEGF) for nanoscale transistors has been developed and applied in the simulation of a novel dual-gate metal-oxide-semi conductor field-effect transistor (MOSFET) device structure. The method is based on the algorithm of nested dissection. A graph of the matrix is constructed and decomposed using a tree structure. An upward and downward traversal of the tree yields significant performance improvements for both the speed and memory requirements, compared to the current state-of-the-art recursive methods for NEGF. This algorithm is quite general and can be applied to any problem where certain entries of the inverse of a sparse matrix (e.g., its diagonal entries, the first row or column, etc.) need to be computed, As such it is applicable to the calculation of the Green's function of partial differential equations. FIND is applicable even when complex boundary conditions are used, for example non reflecting boundary conditions.

Discipline(s)

Electrical and Computer Engineering | Nanoscience and Nanotechnology

 

Share