|
Size: 1557
Comment:
|
Size: 1955
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 3: | Line 3: |
| == Introduction == | <<TableOfContents>> |
| Line 5: | Line 5: |
| An '''inverse matrix''' is a matrix A^-1^ where multiplying it by matrix A results in the identity matrix. | ---- |
| Line 7: | Line 7: |
| If A^-1^ exists, then A is '''invertible''' and '''non-singular'''. Not all matrices are invertible. | |
| Line 9: | Line 8: |
| Consider the below problem: | == Definition == For some matrices ''A'', the '''inverse matrix''' (''A^-1^'') is that which can be multiplied by the original matrix to produce the [[LinearAlgebra/SpecialMatrices#Identity_Matrix|identity matrix]]. Not all matrices have an inverse matrix. If ''A^-1^'' exists, then A is '''invertible''' and '''non-singular'''. === Properties === For a [[LinearAlgebra/PermutationMatrices|permutation matrix]] ''P'', the inverse is also the [[LinearAlgebra/MatrixTransposition|transpose]]: ''P^-1^ = P^T^''. For a square matrix ''A'', the '''left inverse''' is the same as the '''right inverse'''. ''AA^-1^ = A^-1^A = I'' ---- == Calculation == Consider the below system, which shows an unknown matrix (A^-1^'') multiplied by a known matrix (''A'') creating an [[LinearAlgebra/SpecialMatrices#Identity_Matrix|identity matrix]] (''I''). |
| Line 12: | Line 32: |
| -1 A A = I |
|
| Line 18: | Line 41: |
| The inverse matrix is calculated with [[LinearAlgebra/Elimination|elimination]] and [[LinearAlgebra/Elimination#Reduced_Row_Echelon_Form|reverse elimination]]. [[LinearAlgebra/Elimination#Simplification_with_Augmented_Matrices|Augment]] ''A'' with ''I''. | |
| Line 19: | Line 43: |
== Properties == For a permutation matrix, the inverse is also the transpose: P^-1^ = P^T^. For a square matrix A, the left inverse is the same as the right inverse. AA^-1^ = A^-1^A = I == Gauss-Jordan Calculation == The inverse matrix can be calculated through elimination and reverse elimination. First step: |
The elimination proceeds as: |
| Line 39: | Line 50: |
2 - 1m = 0 m = 2 2 7 0 1 - 1m - 3m - 1m - 0m ____ ____ ____ ____ 0 1 -2 1 ┌ ┐ │ [1] 3 │ 1 0│ │ 0 1 │ -2 1│ └ ┘ |
┌ ┐ │ [1] 3 │ 1 0│ │ 0 [1] │ -2 1│ └ ┘ |
| Line 54: | Line 56: |
| Second step: | The reverse elimination proceeds as: |
| Line 61: | Line 63: |
3 - 1m = 0 m = 3 1 3 1 0 - 0m - 1m - -2m - 1m ____ ____ _____ ____ 1 0 7 -3 ┌ ┐ │ 1 0 │ 7 -3│ │ 0 [1] │ -2 1│ └ ┘ |
┌ ┐ │ [1] 0 │ 7 -3│ │ 0 [1] │ -2 1│ └ ┘ |
| Line 76: | Line 69: |
| The inverse matrix of A is: | ''A^-1^'' is: |
Matrix Inversion
Contents
Definition
For some matrices A, the inverse matrix (A-1) is that which can be multiplied by the original matrix to produce the identity matrix.
Not all matrices have an inverse matrix. If A-1 exists, then A is invertible and non-singular.
Properties
For a permutation matrix P, the inverse is also the transpose: P-1 = PT.
For a square matrix A, the left inverse is the same as the right inverse. AA-1 = A-1A = I
Calculation
Consider the below system, which shows an unknown matrix (A-1) multiplied by a known matrix (A) creating an identity matrix (I). The inverse matrix is calculated with elimination and reverse elimination. Augment The elimination proceeds as: The reverse elimination proceeds as: -1
A A = I
┌ ┐┌ ┐ ┌ ┐
│ 1 3││ a b│ │ 1 0│
│ 2 7││ c d│ = │ 0 1│
└ ┘└ ┘ └ ┘
┌ ┐
│ [1] 3 │ 1 0│
│ 2 7 │ 0 1│
└ ┘
┌ ┐
│ [1] 3 │ 1 0│
│ 0 [1] │ -2 1│
└ ┘
┌ ┐
│ 1 3 │ 1 0│
│ 0 [1] │ -2 1│
└ ┘
┌ ┐
│ [1] 0 │ 7 -3│
│ 0 [1] │ -2 1│
└ ┘
A-1 is: ┌ ┐
│ 7 -3│
│ -2 1│
└ ┘