Gauss-Jordan Elimination Calculator

Solve a system of linear equations Ax = b using Gauss-Jordan elimination with complete row-operation steps.

100% Free No Sign-Up Calculated in Your Browser

Number of Equations

Coefficient Matrix A

Constants b

← Solve Ax = b

Solve a system of linear equations Ax = b by reducing the augmented matrix to reduced row-echelon form, with every row operation shown.

How It Works

How Gauss-Jordan Elimination Calculator Works

Gauss-Jordan elimination solves a system of linear equations by first writing it as an augmented matrix [A | b] — the coefficients of each equation next to the constants on the right-hand side. It then applies row operations (swapping rows, scaling a row, and adding a multiple of one row to another) to transform the left side into the identity matrix.

At each step, the calculator picks the largest available entry in the current column as the pivot (partial pivoting) for numerical stability, scales that row so the pivot equals 1, and then eliminates every other entry in that column — above and below — by subtracting the right multiple of the pivot row. Once every column has been processed this way, the matrix is in reduced row-echelon form.

When the left side becomes the identity matrix, the right-hand column directly gives the solution: x₁, x₂, x₃, and so on. If a row reduces to all zeros on the left but a non-zero value on the right, the system is inconsistent and has no solution; if a row becomes entirely zero (0 = 0), the system has infinitely many solutions with at least one free variable.

Worked Example

See It In Action

For the system x + y + z = 7, 2y + 5z = −4, and 2x + 5y − z = 29 (matrix A = [[1,1,1],[0,2,5],[2,5,−1]], b = [7,−4,29]): row-reducing [A | b] step by step eliminates x from rows 2 and 3, then y from the remaining rows, leaving the identity matrix on the left and the solution on the right: x = 6, y = 3, z = −2. Checking equation 1: 6 + 3 + (−2) = 7 ✓.

Real-World Use Cases

Who Uses Gauss-Jordan Elimination Calculator and Why

Solving a system of three or more linear equations directly by reducing the augmented matrix to reduced row-echelon form.
Determining whether a system has exactly one solution, no solution, or infinitely many, based on the final row pattern.
Handling larger systems where Cramer's Rule becomes computationally impractical due to the cost of computing many determinants.
Checking each row operation of a hand-worked elimination problem against the calculator's step-by-step output.

Common Mistakes

Mistakes to Avoid

Misreading a row of all zeros on the left with a non-zero value on the right ([0 0 0 | k]) as anything other than an inconsistent, unsolvable system.
Confusing a fully zero row (0 = 0, meaning a redundant equation and infinitely many solutions) with the contradictory row above — they signal opposite outcomes.
Assuming the row swaps performed during elimination (partial pivoting) change the final answer — they only improve numerical stability and never alter the solution itself.

Pro Tips

Tips for Best Results

Watch specifically for a [0 0 0 | k] row (no solution) versus an all-zero row (infinitely many solutions) when the system doesn't reduce cleanly to a unique answer.
Prefer this calculator over Cramer's Rule once a system grows past 3 variables, since Gauss-Jordan scales far better computationally.

Troubleshooting

Fixing Common Problems

A row reduced to [0 0 0 | k] with k not zero. — The equations are contradictory — the system has no solution at all.

A row reduced entirely to zero. — One equation was redundant with the others — the system has infinitely many solutions with at least one free variable.

Glossary

Terms Explained

Reduced row-echelon form: A simplified form of a matrix where each pivot column has a single 1 and zeros elsewhere, allowing the solution to be read directly off the last column.

Partial pivoting: Swapping in the row with the largest available value in the current column before dividing by it, to improve numerical accuracy.

FAQ

Frequently Asked Questions

What does "reduced row-echelon form" mean?

It means the augmented matrix has been simplified so that each pivot column has a 1 in exactly one row and 0s everywhere else in that column, with pivots arranged in a staircase pattern — once a coefficient matrix reaches this form, its solution can be read directly from the last column.

What if the system has no solution or infinitely many?

If row reduction produces a row like [0 0 0 | k] with k not equal to zero, the equations contradict each other and there is no solution. If instead a row becomes entirely zero (0 = 0), one equation was redundant, and the system has infinitely many solutions with at least one free variable.

Why does the calculator swap rows during elimination?

This is called partial pivoting — swapping in the row with the largest available value in the current column before dividing by it. It avoids dividing by very small numbers, which improves numerical accuracy, and is standard practice even though it doesn't change the final answer.

How is Gauss-Jordan elimination different from Cramer's Rule?

Both solve systems of linear equations, but Gauss-Jordan works directly on the augmented matrix with row operations and scales well to larger systems, while Cramer's Rule uses determinants of individual variable-substituted matrices and becomes computationally expensive as the system grows.