𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An accelerated inversion algorithm using the resolvent matrix method

✍ Scribed by S.Y. Wu; J.A. Cocks; C.S. Jayanthi

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
652 KB
Volume
71
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

✦ Synopsis

A new inversion algorithm is proposed in this paper based on the resolvent matrix method. The basic steps in our algorithm involve partitioning the original matrix into smaller blocks and finding inverses of a sequence of matrices of small dimensions and matrix multiplications. This inversion algorithm has been applied to invert large general matrices. The efficiency of our algorithm has been compared to two standard inversion routines (NAG FO1AAF and ESSL DGEICD, both vectorized). The inversion scheme presented has the versatility to allow for the sparseness and symmetry of the matrix.

πŸ“œ SIMILAR VOLUMES

An algorithm for the numerical inversion
An algorithm for the numerical inversion of a tridiagonal matrix
✍ Kumar, Surendra ;Shashi, ;PethΓΆ, Árpad πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 280 KB πŸ‘ 2 views

This paper presents an algorithm for obtaining the inverse of a tridiagonal matrix numerically. The algorithm does not require diagonal dominance in the matrix and is also computationally efficient.

Computing entries of the inverse of a sp
Computing entries of the inverse of a sparse matrix using the FIND algorithm
✍ S. Li; S. Ahmed; G. Klimeck; E. Darve πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 538 KB

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) d