𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by S. Li; S. Ahmed; G. Klimeck; E. Darve

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
538 KB
Volume
227
Category
Article
ISSN
0021-9991

No coin nor oath required. For personal study only.

✦ Synopsis

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-semiconductor 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.

πŸ“œ SIMILAR VOLUMES

Finding the inverse and connections of a
Finding the inverse and connections of a type of large sparse matrix
✍ Martin Hershkowitz; Stedman B. Noble πŸ“‚ Article πŸ“… 1965 πŸ› John Wiley and Sons 🌐 English βš– 621 KB

series is d e c o m p o s e d i n t o t e r m s which a r e p r o d u c t s of connected coefficients: the p r o c e d u r e lends itself to an efficient method of truncation that obtains a n a p p r o x im a t i o n t o the i n v e r s e m a t r i x . While t h i s a l g o r i t h m might not be e

Fast algorithms for placing large entrie
Fast algorithms for placing large entries along the diagonal of a sparse matrix
✍ Vamsi Kundeti; Sanguthevar Rajasekaran πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 285 KB

a b s t r a c t Solving a sparse system of linear equations Ax = b is one of the most fundamental operations inside any circuit simulator. The equations/rows in the matrix A are often rearranged/permuted before factorization and applying direct or iterative methods to obtain the solution. Permuting