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

DOI10.1016/j.jcp.2008.06.033zbMath1214.82124WikidataQ57369279 ScholiaQ57369279MaRDI QIDQ955257

B. E. Eshmatov

Publication date: 19 November 2008

Published in: Journal of Computational Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcp.2008.06.033

zbMATH Keywords

Green's function; Gaussian elimination; sparse matrix; nested dissection; nanotransistor; NEGF; semiconductor field-effect transistor

Mathematics Subject Classification ID

65F50: Computational methods for sparse matrices

82D37: Statistical mechanics of semiconductors

65F05: Direct numerical methods for linear systems and matrix inversion

Related Items

A probing method for computing the diagonal of a matrix inverse, Finding off‐diagonal entries of the inverse of a large symmetric sparse matrix, A fast algorithm for sparse matrix computations related to inversion, Extension and optimization of the FIND algorithm: Computing Green's and less-than Green's functions, A two-dimensional domain decomposition technique for the simulation of quantum-scale devices, A hybrid method for the parallel computation of Green's functions, Fast Sparse Selected Inversion

Cites Work

• Unnamed Item
• Reduktionsverfahren für Differenzengleichungen bei Randwertaufgaben. I
• Inverse Iteration, Ill-Conditioned Equations and Newton’s Method
• On computing certain elements of the inverse of a sparse matrix
• A DIRECT SOLUTION TO THE BLOCK TRIDIAGONAL MATRIX INVERSION PROBLEM
• The Calculation of the Eigenvectors of a General Complex Matrix by Inverse Iteration
• On Direct Methods for Solving Poisson’s Equations
• Nested Dissection of a Regular Finite Element Mesh