Linear and multilinear algebra; matrix theory Concept
Computing the inverse by row reduction
Summary
Row reduction computes the inverse of a square matrix, or shows that no inverse exists. Let be an matrix over a field , and form the augmented matrix . Apply Gauss–Jordan elimination to it. If the left block becomes , then the result is , and the right block is the inverse. If the left block gets a zero row, then is not invertible.
Remarks
The method works because each row operation is left multiplication by an elementary matrix. If , then , and the same product changes into . For , the method gives .
Further reading
- Web https://en.wikipedia.org/wiki/Gaussian_elimination, Finding the inverse of a matrix
About this page
| Tag | 0Z83DHFMYM |
|---|---|
| URI | m2://0Z83DHFMYM |
| Kind | concept |
| Writing | W0 stub |
| MSC | 15A09, 65F05 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.