Enlargement Methods for Computing the Inverse Matrix
Louis Guttman
Abstract
Open-access reader
Louis Guttman
Abstract
Open-access reader
The enlargement principle provides techniques for inverting any nonsingular matrix by building the inverse upon the inverses of successively larger submatrices. The computing routines are relatively easily learned since they are repetitive. Three different enlargement routines are outlined: first-order, second-order, and geometric. None of the procedures requires much more work than is involved in squaring the matrix.
OpenAlex reports 105 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The enlargement principle provides techniques for inverting any nonsingular matrix by building the inverse upon the inverses of successively larger submatrices. The computing routines are relatively easily learned since they are repetitive. Three different enlargement routines are outlined: first-order, second-order, and geometric. None of the procedures requires much more work than is involved in squaring the matrix.
Key concepts: Invertible matrix, Block matrix, Mathematics, Inverse, Matrix (chemical analysis), Block (permutation group theory), Algebra over a field, Algorithm