Matrix Inverse Calculator
Find the inverse of a 2×2 or 3×3 matrix instantly. Use it when solving linear systems, transforming coordinates, or computing solutions in engineering and computer graphics.
About this calculator
The inverse of a square matrix A, written A⁻¹, satisfies A · A⁻¹ = I, where I is the identity matrix. For a 2×2 matrix [[a, b], [c, d]], the inverse is A⁻¹ = (1 / det(A)) · [[d, −b], [−c, a]], where det(A) = ad − bc. If det(A) = 0, the matrix is singular and no inverse exists. For 3×3 matrices, the inverse is computed as A⁻¹ = (1 / det(A)) · adj(A), where adj(A) is the adjugate (transpose of the cofactor matrix). Alternatively, Gauss-Jordan elimination augments [A | I] and row-reduces until the left side becomes I, leaving A⁻¹ on the right. Matrix inverses are essential for solving Ax = b as x = A⁻¹b.
How to use
Take the matrix A = [[3, 1], [2, 4]]. Identify a = 3, b = 1, c = 2, d = 4. Step 1: det(A) = (3)(4) − (1)(2) = 12 − 2 = 10. Step 2: Since det ≠ 0, compute A⁻¹ = (1/10) · [[4, −1], [−2, 3]] = [[0.4, −0.1], [−0.2, 0.3]]. Step 3: Verify: A · A⁻¹ = [[3·0.4 + 1·(−0.2), 3·(−0.1) + 1·0.3], [2·0.4 + 4·(−0.2), 2·(−0.1) + 4·0.3]] = [[1, 0], [0, 1]] ✓.
Frequently asked questions
How do you find the inverse of a 2x2 matrix step by step?
For a 2×2 matrix [[a, b], [c, d]], first calculate the determinant: det = ad − bc. If det equals zero, the inverse does not exist. Otherwise, swap the positions of a and d, negate b and c, and multiply the resulting matrix by 1/det. The formula is A⁻¹ = (1/(ad−bc)) · [[d, −b], [−c, a]]. Always verify your result by multiplying A and A⁻¹ together — the product should equal the 2×2 identity matrix.
What does it mean when a matrix has no inverse and how can you tell?
A matrix with no inverse is called singular or non-invertible, and it occurs when the determinant equals zero. Geometrically, this means the matrix collapses space onto a lower-dimensional subspace — for example, squashing a 2D plane onto a line — so the transformation cannot be undone. Algebraically, the rows (or columns) are linearly dependent, meaning at least one row is a linear combination of the others. You can detect singularity instantly by computing det(A): if det = 0, no inverse exists and the system Ax = b either has no solution or infinitely many.
When should I use the matrix inverse versus other methods to solve linear equations?
Computing A⁻¹ explicitly is convenient when you need to solve Ax = b for many different right-hand-side vectors b with the same matrix A, because each new solution is just x = A⁻¹b. However, for a single solve, direct methods like Gaussian elimination with LU decomposition are faster and numerically more stable, especially for large matrices. Forming the full inverse roughly doubles the computational work and can amplify floating-point errors. Reserve explicit inversion for small matrices or situations requiring the inverse entries themselves.