Operation
Matrix A
A⁻¹ needs a square matrix, so rows and columns stay linked.
Result — A⁻¹
| 0.2 | 0.2 | 0 |
| −0.2 | 0.3 | 1 |
| 0.2 | −0.3 | 0 |
Self-check: A × A⁻¹ should be the identity
| 1 | 0 | 0 |
| 0 | 1 | 0 |
| 0 | 0 | 1 |
If this is the identity matrix, the inverse is correct.
Gauss-Jordan elimination on [ A | I ]
1. Start with the augmented matrix [ A | I ].
| 3 | 0 | 2 | 1 | 0 | 0 |
| 2 | 0 | −2 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 0 | 1 |
2. R1 ← R1 ÷ 3 (make the pivot equal 1)
| 1 | 0 | 0.666667 | 0.333333 | 0 | 0 |
| 2 | 0 | −2 | 0 | 1 | 0 |
| 0 | 1 | 1 | 0 | 0 | 1 |
3. R2 ← R2 − 2·R1 (clear column 1)
| 1 | 0 | 0.666667 | 0.333333 | 0 | 0 |
| 0 | 0 | −3.333333 | −0.666667 | 1 | 0 |
| 0 | 1 | 1 | 0 | 0 | 1 |
4. R2 ↔ R3 (swap so the largest pivot sits on the diagonal — this keeps the arithmetic stable)
| 1 | 0 | 0.666667 | 0.333333 | 0 | 0 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 0 | 0 | −3.333333 | −0.666667 | 1 | 0 |
5. R3 ← R3 ÷ −3.333333 (make the pivot equal 1)
| 1 | 0 | 0.666667 | 0.333333 | 0 | 0 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0.2 | −0.3 | 0 |
6. R1 ← R1 − 0.666667·R3 (clear column 3)
| 1 | 0 | 0 | 0.2 | 0.2 | 0 |
| 0 | 1 | 1 | 0 | 0 | 1 |
| 0 | 0 | 1 | 0.2 | −0.3 | 0 |
7. R2 ← R2 − 1·R3 (clear column 3)
| 1 | 0 | 0 | 0.2 | 0.2 | 0 |
| 0 | 1 | 0 | −0.2 | 0.3 | 1 |
| 0 | 0 | 1 | 0.2 | −0.3 | 0 |
8. The left half is now the identity, so the right half is A⁻¹.
| 1 | 0 | 0 | 0.2 | 0.2 | 0 |
| 0 | 1 | 0 | −0.2 | 0.3 | 1 |
| 0 | 0 | 1 | 0.2 | −0.3 | 0 |
Rows are swapped to put the largest pivot on the diagonal, which keeps the arithmetic stable. Many valid row-operation paths reach the same inverse, so your textbook's sequence may differ while the final matrix agrees.
| Operation | Requirement | Result shape |
|---|---|---|
| A + B, A − B | identical dimensions | same as A |
| A × B | columns of A = rows of B | rows(A) × cols(B) |
| k × A | any shape | same as A |
| Aᵀ | any shape | cols(A) × rows(A) |
| det(A) | square, up to 5×5 | single number |
| A⁻¹ | square and det(A) ≠ 0 | same as A |
| rank(A) | any shape | single number ≤ min(rows, cols) |
| tr(A) | square | single number |
| Aⁿ | square, integer n from −10 to 10 | same as A |
Determinants use cofactor (Laplace) expansion by minors and inverses use Gauss-Jordan elimination, both as described on Wolfram MathWorld and taught on Math is Fun. MathWorld's rule applies throughout: a square matrix has an inverse if and only if its determinant is non-zero. Matrix entries are unitless.
100% Private
Every row operation runs in your browser. No matrix is uploaded.