Gauss Jordan Calculator — Solve Linear Systems with Row Reduction

Perform Gauss Jordan elimination to solve systems of linear equations. Enter an augmented matrix for step-by-step RREF solutions, detailed row operations, and instant results.

Verified Algorithm Instant RREF Privacy First

Gauss Jordan Elimination Calculator

Enter the augmented matrix below. Each row represents one equation; the last column is the constant term (right-hand side).

x₁x₂Constant
Enter matrix values and click Calculate RREF to see the reduced row echelon form.

Gauss Jordan Elimination Method Explained

Gauss Jordan elimination is a systematic algorithm for solving systems of linear equations. It transforms an augmented matrix into Reduced Row Echelon Form (RREF) using three elementary row operations. Unlike Gaussian elimination, Gauss Jordan goes all the way to RREF, yielding the solution directly without back substitution.

The Three Elementary Row Operations

  • Row Swap (Rᵢ ↔ Rⱼ): Interchange two rows. Used for partial pivoting to improve numerical stability.
  • Row Scaling (kRᵢ → Rᵢ): Multiply all entries in a row by a nonzero constant. Used to create leading 1s (pivots).
  • Row Addition (Rᵢ + kRⱼ → Rᵢ): Add a multiple of one row to another. Used to eliminate entries above and below pivots.

RREF Conditions

A matrix is in RREF when all four conditions are met:

  1. All zero rows are at the bottom of the matrix.
  2. The leading entry (first nonzero) of each nonzero row is 1 — called a pivot.
  3. Each pivot is the only nonzero entry in its entire column.
  4. Pivots appear in a staircase pattern moving left to right and top to bottom.
RREF Example:  [1 0 0 | a]  [0 1 0 | b]  [0 0 1 | c]  →  x₁=a, x₂=b, x₃=c

How to Use the Gauss Jordan Calculator

  1. Select system size — Choose 2×2, 3×3, or 4×4 depending on the number of equations and variables in your system.
  2. Enter coefficients — Fill each row with the variable coefficients followed by the constant term. For example, the equation 2x + 3y = 5 becomes the row [2, 3, 5].
  3. Click Calculate RREF — The calculator performs Gauss Jordan elimination with partial pivoting for numerical accuracy.
  4. Review the results — Examine the RREF matrix, the solution (or special case message), and the step-by-step row operations.
  5. Copy or share — Use the action buttons to copy the solution, copy all steps, share the result, or print.

Gauss Jordan Elimination Examples

Example 1: Unique Solution (2×2)

Solve: 2x + y = 5, x - y = 1

Augmented: [2  1 | 5] → RREF: [1  0 | 2]
[1 -1 | 1]               [0  1 | 1]
Solution: x = 2, y = 1

Example 2: Unique Solution (3×3)

Solve: x + y + z = 6, 2x - y + z = 3, x + 2y - z = 2

RREF: [1 0 0 | 1]  →  x = 1
[0 1 0 | 2]  →  y = 2
[0 0 1 | 3]  →  z = 3

Example 3: Infinite Solutions

Solve: x + y + z = 3, 2x + 2y + 2z = 6, x - y + z = 1

RREF reveals free variable z: x = 2 - z, y = 1. Infinitely many solutions expressed parametrically.

Real-World Applications of Gauss Jordan Elimination

  • Engineering Analysis: Solving circuit equations (Kirchhoff's laws), structural analysis, and truss problems involving multiple linear constraints.
  • Computer Graphics: Computing transformation matrices, solving for intersection points, and determining inverse matrices for 3D rendering.
  • Economic Modeling: Solving input-output models, market equilibrium systems, and Leontief production models in macroeconomics.
  • Data Science & Machine Learning: Solving normal equations in linear regression, computing matrix inverses for optimization algorithms.
  • Chemical Equation Balancing: Determining stoichiometric coefficients by solving linear conservation equations for atoms.
  • Network Flow Analysis: Computing traffic flow distributions, supply chain logistics, and communication network bandwidth allocation.
  • Operations Research: Solving linear programming constraint systems as part of the simplex method for optimization.

People Also Ask

Gauss Jordan elimination is primarily used to solve systems of linear equations, compute matrix inverses, and determine the rank of a matrix. It transforms an augmented matrix into reduced row echelon form (RREF), from which the solution can be read directly without back substitution.
Gaussian elimination stops at row echelon form (upper triangular) and requires back substitution to find solutions. Gauss Jordan elimination continues the process, eliminating entries above pivots as well, to achieve full reduced row echelon form (RREF), yielding solutions directly.
A system has no solution if, during Gauss Jordan elimination, a row reduces to [0 0 ... 0 | c] where c ≠ 0. This represents the equation 0 = c, which is impossible. Such a row indicates the original system is inconsistent with contradictory equations.
Free variables arise when a system has fewer pivot positions than variables (rank < number of variables). Columns without pivots in the RREF correspond to free variables that can take any real value. The pivot variables are then expressed in terms of the free variables, yielding infinitely many solutions.
Partial pivoting selects the largest absolute value in a column as the pivot, reducing round-off errors in floating-point arithmetic. Without pivoting, small pivot values can amplify numerical errors, leading to inaccurate results. It is essential for stable numerical computation in Gauss Jordan elimination.

Frequently Asked Questions

This calculator supports 2×2, 3×3, and 4×4 systems of linear equations. Toggle between sizes using the mode buttons. Each system size creates the appropriate number of input rows with coefficient columns plus a constant term column for the augmented matrix.
Yes. After calculation, the step-by-step breakdown shows each row operation performed—including row swaps, scaling operations, and elimination steps—along with the state of the matrix after each operation. You can also copy all steps using the Copy Steps button.
Absolutely. The calculator detects inconsistent systems (no solution) when a row reduces to [0 ... 0 | nonzero]. It also identifies infinite solution cases by detecting free variables when the rank is less than the number of variables, and displays the RREF accordingly.
The augmented matrix combines the coefficient matrix and the constant vector. Each row represents one equation: the first n columns contain variable coefficients, and the last column (after the separator) contains the right-hand side constant. For example, 2x + 3y = 7 becomes the row [2, 3 | 7].
Yes. The calculator accepts all real numbers including decimals and negative values. Results are displayed with up to 6 decimal places of precision. For exact fractional results, consider using a symbolic algebra system, as this calculator uses floating-point arithmetic.
An elimination calculator typically solves systems by sequentially eliminating variables equation by equation. The Gauss Jordan calculator works directly on the augmented matrix using row operations, providing the full RREF and a clear view of all row operations performed—making it ideal for linear algebra coursework.

Gauss Jordan Elimination Glossary

Augmented Matrix

A matrix formed by appending the constant vector to the coefficient matrix, separated by a vertical bar. Represents an entire linear system compactly.

RREF

Reduced Row Echelon Form — the unique matrix form where each pivot is 1, pivots are the only nonzero in their column, and pivot columns form a staircase.

Pivot

The leading 1 in a nonzero row of a matrix in RREF. Pivot positions determine the rank and identify basic vs. free variables.

Row Operation

One of three allowed operations: swapping two rows, multiplying a row by a nonzero scalar, or adding a multiple of one row to another.

Partial Pivoting

A numerical stability technique that selects the largest absolute value in a column as the pivot row, reducing floating-point errors.

Rank

The number of pivot positions (leading 1s) in the RREF of a matrix. Equal to the number of linearly independent rows or columns.

Free Variable

A variable corresponding to a column without a pivot in RREF. Can take any value; pivot variables are expressed in terms of free variables.

Consistent System

A linear system that has at least one solution. In RREF, no row reduces to [0 0 ... 0 | c] with c ≠ 0.

Editorial Review & Methodology

This Gauss Jordan calculator was built and reviewed by the NumbrWiz Editorial Team. The Gauss Jordan elimination algorithm is a standard method in linear algebra, verified against authoritative textbooks including Gilbert Strang's Linear Algebra and Its Applications and David C. Lay's Linear Algebra and Its Applications.

  • Algorithm verification: Cross-checked against multiple linear algebra textbooks and peer-reviewed numerical methods references.
  • Partial pivoting: Implemented to ensure numerical stability and minimize floating-point round-off errors.
  • Edge case testing: Tested with unique solutions, infinite solutions (free variables), inconsistent systems, zero rows, and singular matrices.
  • UX review: Designed with clear matrix input, intuitive mode selection, and comprehensive step-by-step breakdown.

Transparency note: All calculations run client-side in your browser using JavaScript. No data is ever collected, stored, or transmitted. Results are for educational purposes; verify critical calculations independently. This calculator uses floating-point arithmetic with a tolerance of 1×10⁻¹² for zero detection.

Page last reviewed: May 2026 · NumbrWiz Editorial Team