How To Do Gauss Jordan Elimination
By The Calcumatix Team Reviewed by Calcumatix Editorial Review 3 min read
Quick Answer
To perform Gauss-Jordan elimination, write the system of equations as an augmented matrix, then use row operations (swapping rows, scaling a row, or adding a multiple of one row to another) to transform the left side into the identity matrix, ones on the diagonal and zeros everywhere else. Once that form is reached, the values in the rightmost column are the solution to the system, with no back-substitution required.
Gauss-Jordan elimination solves a system of linear equations by transforming it into an augmented matrix and applying row operations until the answer can be read directly off the page, no back-substitution required. This guide walks through the procedure on a 2x2 system: build the matrix, reduce it to reduced row echelon form, and read the solution. To skip the manual math, use the Gauss-Jordan calculator to get the result instantly for a 2x2 system.
Step by step:
- Convert the system of equations into an augmented matrix.
- Use row operations to transform the coefficient portion into the identity matrix.
- Clear any remaining nonzero entries above the diagonal, then read the solution from the rightmost column.
Step One: Convert The System Into An Augmented Matrix
Strip the variable names from each equation and arrange only the coefficients and constants into a grid, keeping the constant terms in a final column separated by a vertical bar. This augmented matrix representation lets every subsequent step operate purely on numbers.
Step Two: Use Row Operations To Build The Identity Matrix
Apply the three allowed row operations, swapping rows, scaling a row, or adding a multiple of one row to another, to turn the diagonal entries of the coefficient portion into 1s and every other entry in that portion into 0. This target shape is called the identity matrix.
Step Three: Clear The Entries Above The Diagonal
Working from the bottom row upward, use the same row operations to eliminate any remaining nonzero entries above the diagonal. Once the coefficient portion contains only 1s on the diagonal and 0s everywhere else, the matrix is in reduced row echelon form, and the answer column holds the solution.
Worked Example: Solving A 2x2 System
Worked example: System: 2x + 4y = 10, and x - y = -1. Step 1 (build matrix): Row 1 is [2, 4 | 10]. Row 2 is [1, -1 | -1]. Step 2 (build the identity matrix): Swap the rows so the leading 1 is on top: Row 1 becomes [1, -1 | -1]. Subtract 2 times Row 1 from Row 2: Row 2 becomes [0, 6 | 12]. Divide Row 2 by 6: Row 2 becomes [0, 1 | 2]. Step 3 (clear above the diagonal): Add Row 2 to Row 1: Row 1 becomes [1, 0 | 1].
Final answer: x = 1, y = 2. Both values are read directly from the rightmost column with no further algebra needed.
What Is Reduced Row Echelon Form?
Reduced row echelon form is the specific target shape of the matrix: every leading entry on the diagonal is 1, and every other entry in the coefficient columns is 0. Reaching this form is what makes Gauss-Jordan elimination different from standard Gaussian elimination, since it lets every variable’s value be read straight from the final column instead of requiring back-substitution.
Does This Method Scale To Larger Systems?
Yes, the same three row operations and the same target of reduced row echelon form apply to systems with any number of variables, not just two. A 3x3 system produces a 3-row augmented matrix, and a 4x4 system produces four rows, following the identical logic shown in the worked example above. The arithmetic simply takes more steps to clear each additional row and column. See the math calculators hub for related tools.
Sources and References
- OpenStax, College Algebra 2e, systems of linear equations and matrix methods.
- Khan Academy, Systems of Equations with Matrices
Disclaimer: This guide is for educational and informational purposes only. It provides general mathematical procedures and should not replace formal academic instruction. Consult your textbook or mathematics instructor for specific academic requirements.
Frequently asked questions
What are the three valid row operations?
Only three moves are allowed on the augmented matrix: swapping two rows, multiplying an entire row by a nonzero constant, and adding or subtracting a multiple of one row to another. Any other move changes the underlying system of equations and produces an incorrect answer.
How is Gauss-Jordan elimination different from standard Gaussian elimination?
Standard Gaussian elimination stops once the matrix reaches row echelon form (zeros below the diagonal only), then requires back-substitution to find each variable in turn. Gauss-Jordan elimination continues clearing the entries above the diagonal too, reaching reduced row echelon form, so the answers can be read directly from the final column with no extra back-substitution step.
What does an entire row of zeros mean?
A row that reduces to all zeros, including in the answer column, means the system has infinitely many solutions. This happens when one equation is a multiple of another, so the two lines (or planes) overlap rather than crossing at a single point.
What does a row like [0 0 | 5] mean?
A row where the coefficients are all zero but the answer column is nonzero represents a contradiction, such as 0 = 5, which is never true. This indicates the system has no solution; the original equations describe parallel lines or planes that never intersect.
Why is reaching the identity matrix useful?
Once the left side of the augmented matrix is the identity matrix, each row directly represents one variable equal to one number, with no further algebra needed. The first row gives the value of the first variable, the second row gives the second variable, and so on, read straight off the rightmost column.