Matrix Inverse Solver

Math Linear Algebra • Matrices and Systems of Equations

Written by STEM Calculators Team Published February 21, 2026 Updated February 24, 2026

Compute the inverse \(A^{-1}\) (when it exists) so that \(A A^{-1}=I\). For \(2\times 2\), use the closed form \(A^{-1}=\frac{1}{\det(A)}\operatorname{adj}(A)\). For larger matrices, use Gauss–Jordan elimination on the augmented matrix \([A\mid I]\).

Size (n×n)

Method

Display decimals

Tolerance

Show all row-operation snapshots (can be long)

Matrix \(A\)

2×2

→

Inverse \(A^{-1}\)

2×2

Check \(A A^{-1}\)

2×2

Ready

Augmented matrix \([A\mid I]\) visualization

Drag to pan • wheel to zoom • double-click to reset. Play animates Gauss–Jordan steps once and stops automatically (pivot highlighted).

left block (A) right block (I / A^{-1}) pivot pivot row

Enter a matrix and click “Calculate”.

Rate this calculator

0.0 /5 (0 ratings)

Be the first to rate.

Your rating

Name (optional) Review (optional)

You can update your rating any time.

Theory

What an inverse matrix means

For a square matrix \(A\in\mathbb{R}^{n\times n}\), an inverse \(A^{-1}\) is a matrix that undoes the action of \(A\). The defining property is \[ A A^{-1} = I \quad \text{and} \quad A^{-1}A = I, \] where \(I\) is the identity matrix (ones on the diagonal, zeros elsewhere). If such a matrix exists, \(A\) is called invertible or nonsingularsingular.

Invertibility is tightly connected to linear systems. The system \(Ax=b\) has a unique solution for every \(b\) exactly when \(A\) is invertible; in that case the solution is \(x=A^{-1}b\). Geometrically, an invertible matrix represents a linear transformation that is one-to-one and onto: it stretches, rotates, shears, or reflects space without “flattening” it into a lower dimension.

Determinant check and singularity

The determinant \(\det(A)\) is a scalar that signals whether a matrix is invertible. A fundamental theorem states: \[ A \text{ is invertible } \Longleftrightarrow \det(A)\neq 0. \] For \(2\times 2\) matrices, the determinant has a simple formula. If \(A=\begin{bmatrix}a&b\\c&d\end{bmatrix}\), then \(\det(A)=ad-bc\). When \(\det(A)=0\), the rows (or columns) are linearly dependent, meaning \(A\) collapses area to zero and cannot be reversed.

In computation, “near-singular” matrices (very small \(|\det(A)|\) or very small pivots during elimination) can lead to large numerical errors. That is why inverse solvers often include pivoting strategies and report warnings when pivots become tiny.

2×2 closed-form inverse

For a \(2\times 2\) matrix \(A=\begin{bmatrix}a&b\\c&d\end{bmatrix}\) with \(\det(A)=ad-bc\neq 0\), the inverse is \[ A^{-1}=\frac{1}{ad-bc}\begin{bmatrix}d&-b\\-c&a\end{bmatrix}. \] The matrix \(\begin{bmatrix}d&-b\\-c&a\end{bmatrix}\) is the adjugate (transpose of the cofactor matrix) for \(2\times 2\). This formula is fast and exact in algebraic form, and it is a good way to build intuition: changing the sign of off-diagonal entries and swapping the diagonal entries is the “adjugate” step, then scaling by \(1/\det(A)\) completes the inverse.

Gauss–Jordan elimination for larger matrices

For larger \(n\), a standard approach is Gauss–Jordan elimination. You form the augmented matrix \([A\mid I]\) and apply elementary row operations until the left block becomes the identity: \[ [A\mid I]\ \longrightarrow\ [I\mid A^{-1}]. \] The allowed row operations are: (1) swap two rows, (2) multiply a row by a nonzero scalar, and (3) add a multiple of one row to another row. These operations preserve the solution set of linear equations and, when applied to \([A\mid I]\), transform the identity block into the inverse.

Partial pivoting (choosing the row with the largest absolute pivot in the current column) improves numerical stability by avoiding division by very small numbers when possible. The calculator visualizes the pivot position and the augmented matrix during the elimination steps. If a pivot cannot be found (all remaining candidates are essentially zero), the matrix is singular (or numerically indistinguishable from singular), and the inverse does not exist.

Application tease: “decrypting” a linear mix

Inverse matrices are often described as “decoders.” If data is mixed by \(y=Ax\), then \(x=A^{-1}y\) recovers the original vector whenever \(A^{-1}\) exists. This reversibility is the foundation of many linear methods (undoing a change of basis, reversing a transformation, solving systems).

Some classic matrix-based ciphers (e.g., Hill cipher) operate in modular arithmetic, where the inverse must be computed modulo an integer. That requires additional conditions (like \(\gcd(\det(A),m)=1\)) and uses modular inverses. This calculator works over real numbers, but the “undoing a linear mix” idea is the same.

Rate this calculator

Related calculators