Gauss-Jordan Elimination Calculator - Solve Linear Systems
Solve systems of linear equations by transforming an augmented matrix into reduced row echelon form.
Enter the coefficients of your linear system, set the matrix dimensions, and click Solve to get the complete solution.
Gauss-Jordan Elimination Calculator - Solve Linear Systems
Solve systems of linear equations by transforming an augmented matrix into reduced row echelon form.
Enter coefficients for each equation. The last column is the constant term (b).
| x1 | x2 | | | b |
|---|---|---|---|
| | | |||
| | |
About Gauss-Jordan Elimination
Gauss-Jordan elimination is a systematic algorithm for solving systems of linear equations by applying elementary row operations to an augmented matrix until it reaches reduced row echelon form (RREF). Named after Carl Friedrich Gauss and Wilhelm Jordan, this method extends Gaussian elimination by continuing the reduction process until every pivot is 1 and every other entry in the pivot column is 0. The result directly reveals the solution without the need for back-substitution.
The process begins by forming the augmented matrix [A | b], where A contains the coefficients of the variables and b holds the constants on the right-hand side of each equation. Three types of row operations are applied: swapping two rows, multiplying a row by a nonzero scalar, and adding a multiple of one row to another. These operations do not change the solution set of the system, so the final RREF matrix represents an equivalent system.
A system of n equations in n unknowns can have exactly one solution (when the coefficient matrix has full rank), no solution (when the system is inconsistent, indicated by a row of zeros on the left with a nonzero right-hand side), or infinitely many solutions (when the system is dependent and has fewer pivot columns than variables). Gauss-Jordan elimination cleanly identifies all three cases.
The method is widely taught in linear algebra courses because it provides a clear, algorithmic path to solving any linear system. In practice, numerical versions of the algorithm use partial pivoting to improve stability and reduce rounding errors. Gauss-Jordan elimination forms the foundation for computing matrix inverses, solving least-squares problems, and computing null spaces.
This calculator implements Gauss-Jordan elimination with partial pivoting for 2x2, 3x3, and 4x4 systems. It displays the full RREF matrix alongside the solution values, giving you both the result and insight into the algebraic structure of the system.
Examples
Representative linear systems and their solutions:
| System | Solution | Notes |
|---|---|---|
| 2x + y = 5, 4x + 3y = 11 | x1 = 2, x2 = 1 | Unique 2x2 solution |
| 2x + y + z = 8, x + 3y - z = 10, x + y + 2z = 7 | x1 = 2, x2 = 3, x3 = 1 | 3x3 unique solution |
| x + y = 3, 2x + 2y = 6 | Infinitely many solutions | Dependent system |
| x + y = 3, x + y = 5 | No solution | Inconsistent system |
How to Use
- Select the number of equations (rows) and variables (columns) using the size buttons.
- Enter the coefficient of each variable in the corresponding matrix cell. The last column holds the constant term.
- Click Solve to run Gauss-Jordan elimination with partial pivoting.
- Read the solution from the Solution panel. If it shows unique values for each variable, those are your answers.
- Examine the RREF matrix below to understand the algebraic structure or verify the computation.
Frequently Asked Questions
What is Gauss-Jordan elimination?
Gauss-Jordan elimination is an extension of Gaussian elimination that reduces an augmented matrix all the way to reduced row echelon form (RREF). Unlike Gaussian elimination, which requires back-substitution, Gauss-Jordan produces a matrix where solutions can be read off directly.
What is reduced row echelon form (RREF)?
A matrix is in RREF when every leading entry (pivot) is 1, every other entry in a pivot column is 0, and the pivots appear left-to-right going down. RREF is unique for any given matrix and directly encodes the solution to the linear system.
What does it mean when the system has no solution?
A system is inconsistent when the elimination process produces a row of the form [0 0 ... 0 | k] where k is nonzero. This means the equations contradict each other and there is no point that satisfies all of them simultaneously.
What does it mean when the system has infinitely many solutions?
Infinitely many solutions occur when the RREF has fewer pivots than variables, leaving free variables. Each free variable can take any real value, generating a family of solutions. The solution set forms a line, plane, or higher-dimensional subspace.
What is partial pivoting and why is it used?
Partial pivoting swaps rows so that the largest absolute value in the current column becomes the pivot. This reduces numerical errors caused by dividing by very small numbers, making the algorithm more stable for floating-point arithmetic.
Can I use this method to find the inverse of a matrix?
Yes. To invert an n-by-n matrix A, augment it with the n-by-n identity matrix to form [A | I] and apply Gauss-Jordan elimination. If A is invertible, the result is [I | A-inverse], giving you the inverse directly. This calculator focuses on augmented systems, but the same row operations apply.