Matrix Inverse Calculator
Find the inverse of a 2×2 or 3×3 matrix instantly. Use this when solving systems of linear equations, transforming coordinates, or working through linear algebra coursework.
About this calculator
The inverse of a matrix A, written A⁻¹, satisfies A · A⁻¹ = I, where I is the identity matrix. A matrix is invertible only when its determinant is non-zero. For a 2×2 matrix [[a, b], [c, d]], the determinant is det = ad − bc, and the inverse is A⁻¹ = (1/det) · [[d, −b], [−c, a]]. Each element of the result is scaled by 1/det after swapping the main diagonal and negating the off-diagonal entries. For example, element (1,1) of the inverse equals d / (ad − bc). Gauss-Jordan elimination generalizes this process to larger matrices by augmenting A with the identity and row-reducing until A becomes I.
How to use
Suppose your 2×2 matrix is [[3, 1], [2, 4]]. Enter b11 = 3, b12 = 1, b21 = 2, b22 = 4. First compute det = (3)(4) − (1)(2) = 12 − 2 = 10. The (1,1) element of the inverse is b22 / det = 4 / 10 = 0.4. The (1,2) element is −b12 / det = −1 / 10 = −0.1. The (2,1) element is −b21 / det = −2 / 10 = −0.2. The (2,2) element is b11 / det = 3 / 10 = 0.3. So A⁻¹ = [[0.4, −0.1], [−0.2, 0.3]].
Frequently asked questions
What does it mean when the matrix inverse calculator returns zero or says the matrix is singular?
A result of zero for the determinant means the matrix is singular — it has no inverse. This happens when the rows (or columns) of the matrix are linearly dependent, meaning one row is a scalar multiple of another. In practical terms, a singular matrix cannot be used to uniquely solve a system of equations because infinitely many or no solutions exist. You should check your entries and confirm that no row is a multiple of another.
How is Gauss-Jordan elimination different from using the determinant formula to find a matrix inverse?
The determinant formula (adjugate divided by det) works neatly for 2×2 and 3×3 matrices but becomes computationally expensive for larger ones. Gauss-Jordan elimination augments the original matrix with an identity matrix and applies row operations until the left side becomes the identity, leaving the inverse on the right. This method scales efficiently to larger matrices and is the standard algorithm used in software. Both methods produce identical results for 2×2 and 3×3 cases.
Why do I need a matrix inverse instead of just dividing by the matrix?
Matrix division is not defined the way scalar division is — you cannot simply divide one matrix by another. Instead, multiplying by the inverse A⁻¹ achieves the equivalent effect: solving Ax = b becomes x = A⁻¹b. This is essential in fields like computer graphics, engineering simulations, and machine learning where transformations must be reversed or systems of equations must be solved. The inverse effectively 'undoes' the linear transformation represented by the original matrix.