A fast algorithm for sparse matrix computations related to inversion

We have developed a fast algorithm for computing certain entries of the inverse of a sparse matrix. Such computations are critical to many applications, such as the calculation of non-equilibrium Green’s functions Gr and G< for nano-devices. The FIND (Fast Inverse using Nested Dissection) algorit...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computational physics Vol. 242; pp. 915 - 945
Main Authors:	Li, S., Wu, W., Darve, E.
Format:	Journal Article
Language:	English
Published:	United States Elsevier Inc 01.06.2013
Subjects:	ALGORITHMS CALCULATION METHODS COMPARATIVE EVALUATIONS Computation Decomposition Dissection Elimination tree ERRORS FUNCTIONS Gaussian elimination Green’s function Inverse Mathematical analysis MATHEMATICAL METHODS AND COMPUTING MATRICES NEGF Nested dissection PARTITION Partitioning Permissible error Separators SIMULATION Sparse matrix Elimination tree Green’s function NEGF Nested dissection Gaussian elimination Sparse matrix Decomposition Inverse
ISSN:	0021-9991, 1090-2716
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!