Start with an augmented matrix
[ A | I ]Attach an identity matrix of the same size to the right of the original square matrix.
Enter integers, decimals, or scientific notation. Display precision does not round intermediate calculations.
Each stage creates one pivot column. The vertical divider separates the evolving left matrix from the evolving right matrix.
[ A | I ]Attach an identity matrix of the same size to the right of the original square matrix.
Rᵢ ↔ Rⱼ Rᵢ ← cRᵢ Rᵢ ← Rᵢ + cRⱼRow swaps, nonzero row scaling, and adding a multiple of one row to another preserve the represented system.
[ A | I ] → [ I | A⁻¹ ]If the left side becomes the identity, the transformed right side is the unique inverse.
10⁻⁴⁰ through 10⁴⁰ in magnitude. The selected relative pivot tolerance determines when a numerical pivot is treated as zero; it does not change the displayed decimal places.The default matrix has determinant −1 and an integer inverse, making the row-operation result easy to check:
[[2, 1, 1], [1, 3, 2], [1, 0, 0]][[0, 0, 1], [−2, 1, 3], [3, −1, −5]]Multiplying these matrices in either order gives the 3×3 identity matrix. The calculator reports the floating-point residual so decimal examples can be checked in the same way.
A matrix is invertible when the transformation it represents is one-to-one. Equivalent tests include a nonzero determinant, full rank, linearly independent rows and columns, and the ability to reduce A to I using row operations. If a pivot column has no usable pivot, the matrix is singular at the selected tolerance and the Gauss–Jordan process cannot produce a unique inverse.
A large condition estimate means small changes or rounding in A can cause much larger changes in A−1. For sensitive matrices, compare the residual, retain only digits justified by the inputs, and use the matrix condition number calculator for additional diagnostics.
Only a square, nonsingular matrix has a two-sided inverse. Its determinant is nonzero and its rows and columns are linearly independent.
It applies the same elementary row operations to both halves of [A | I]. When the left half becomes I, the right half is A⁻¹.
Scaled partial pivoting compares candidate pivots with the size of their rows. A swap avoids a zero pivot and generally improves numerical stability.
No pivot larger than the selected scaled tolerance was available. The matrix may be exactly singular or too close to singular for that threshold. Review the inputs before lowering the tolerance.
It is the largest absolute entry of A·A⁻¹ − I. Values near zero are expected, but the appropriate scale depends on matrix size, conditioning, and input precision.
Most decimal fractions cannot be represented exactly in binary floating point. Elimination and an ill-conditioned matrix can amplify those small errors.
Yes. The page parses and calculates locally, and creates copied text and downloads in your browser. The calculator code does not transmit or save entered values.
Last reviewed: August 5, 2026 by the Starlight Tools editorial team.
The algorithm chooses the largest pivot relative to each candidate row’s original scale, records every row operation, and verifies the result with A·A⁻¹. A successful numerical result is not a claim of exact symbolic invertibility; use exact arithmetic software when exact rational results are required.