Math 2.0

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 AA be an n×nn \times n matrix over a field FF, and form the n×2nn \times 2n augmented matrix [A∣In][A \mid I_n]. Apply Gauss–Jordan elimination to it. If the left block becomes InI_n, then the result is [In∣A−1][I_n \mid A^{-1}], and the right block is the inverse. If the left block gets a zero row, then AA is not invertible.

Remarks

The method works because each row operation is left multiplication by an elementary matrix. If Ek⋯E1A=InE_k \cdots E_1 A = I_n, then Ek⋯E1=A−1E_k \cdots E_1 = A^{-1}, and the same product changes InI_n into A−1A^{-1}. For A=(2111)A = \begin{pmatrix} 2 & 1 \\ 1 & 1 \end{pmatrix}, the method gives A−1=(1−1−12)A^{-1} = \begin{pmatrix} 1 & -1 \\ -1 & 2 \end{pmatrix}.

Further reading

  1. Web https://en.wikipedia.org/wiki/Gaussian_elimination, Finding the inverse of a matrix
About this page
Tag0Z83DHFMYM
URIm2://0Z83DHFMYM
Kindconcept
WritingW0 stub
MSC15A09, 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.