Skip to main content
Calculator Answers

RREF Calculator

Blake Boege
Written by Blake Boege · Founder, Calculator Answers

An RREF calculator is a linear algebra tool that transforms a matrix into its reduced row echelon form using Gauss-Jordan elimination. It takes a matrix of arbitrary dimensions and performs row operations (swapping rows, multiplying a row by a scalar, and adding multiples of rows) until each leading entry is a one and is the only non-zero entry in its column. The calculator also computes the rank of the matrix and solves augmented matrix systems. Students and mathematicians use it to solve systems of linear equations.

Pick a matrix size, enter the entries, and the calculator returns the reduced row echelon form. For augmented matrices it reads the solution (unique, none, or infinite) from RREF.

Quick Answer

Convert any matrix to its reduced row echelon form. Enter the matrix dimensions and values to see step-by-step Gauss-Jordan elimination.

Matrix size

The augmented sizes 2x3 and 3x4 treat the last column as the right-hand side of a linear system.

Matrix entries

Reduced row echelon form

Reading

x = 5, y = 3, z = -2

Unique solution from the rightmost column of RREF.

Row 11 0 0 5
Row 20 1 0 3
Row 30 0 1 -2

Gauss-Jordan elimination drives each pivot to 1 and zeros out the rest of its column. The resulting form is unique for any matrix.

Was this helpful?

Examples

3x4 system: x + y + z = 6; 2y + 5z = -4; 2x + 5y - z = 27

x = 5, y = 3, z = -2

2x3 system: x + 2y = 5; 3x + 4y = 11

x = 1, y = 2

3x3 identity check

rank 3

Augmented with a zero row that doesn't match

no solution

How it works

Gauss-Jordan elimination picks the largest absolute pivot in the current column, scales the pivot row so the pivot is 1, then subtracts multiples of that row from every other row to clear the column. The process repeats column by column.

Scale · divide pivot row by its pivot value

Eliminate · row_k -= (row_k[c] / pivot) × row_pivot

What is Reduced Row Echelon Form (RREF)?

Reduced Row Echelon Form (RREF) is a standardized, simplified state of a matrix achieved through elementary row operations. In linear algebra, reducing a matrix to RREF is the primary method for solving systems of linear equations, finding the inverse of a matrix, determining the rank, and analyzing the span or linear independence of vectors.

The rules of reduced row echelon form

A matrix is in RREF if and only if it satisfies all of the following four conditions:

  • Zero rows: Any rows consisting entirely of zeros must be grouped at the bottom of the matrix.
  • Leading coefficients (Pivots): The first non-zero number in any non-zero row (moving left to right) must be exactly 1.
  • Staircase pattern: For any two consecutive non-zero rows, the leading 1 of the lower row must be strictly to the right of the leading 1 of the upper row.
  • Column clearing: If a column contains a leading 1, all other entries in that column must be exactly 0.

How Gauss-Jordan elimination works

Gauss-Jordan elimination is the algorithm used to transform any matrix into its unique RREF. It uses three types of elementary row operations:

  • Swapping two rows to position a non-zero element as a pivot.
  • Multiplying (scaling) a row by a non-zero constant to turn the pivot into 1.
  • Adding or subtracting a multiple of one row to another row to clear the rest of the column.

Worked example: Finding RREF step-by-step

Let's solve the system represented by this 2x3 augmented matrix:

[ 1 2 | 5 ]
[ 3 4 | 11 ]

Step 1: Eliminate the entry below the first pivot. Multiply the first row by 3 and subtract it from the second row:

Row 2 = Row 2 − (3 × Row 1) = [3 − 3, 4 − 6, 11 − 15] = [0, -2, -4]

The matrix is now:

[ 1 2 | 5 ]
[ 0 -2 | -4 ]

Step 2: Scale the second row. Divide the second row by its leading entry (-2) to make the pivot 1:

Row 2 = Row 2 ÷ -2 = [0, 1, 2]

The matrix is now in Row Echelon Form (REF):

[ 1 2 | 5 ]
[ 0 1 | 2 ]

Step 3: Eliminate the entry above the second pivot. Subtract 2 times the second row from the first row:

Row 1 = Row 1 − (2 × Row 2) = [1 − 0, 2 − 2, 5 − 4] = [1, 0, 1]

The matrix is now in its final Reduced Row Echelon Form (RREF):

[ 1 0 | 1 ]
[ 0 1 | 2 ]

From this RREF, we can read the solution directly: x = 1, y = 2.

Common mistakes in RREF calculations

  • Arithmetic sign errors: The most common error in manual row reduction is making sign mistakes when multiplying and adding negative integers or fractions.
  • Failing to clear above pivots: Stopping once you reach a triangular form (REF). Remember, RREF requires zeros both below and above every leading 1.
  • Dividing by zero: Swapping rows improperly or attempting to scale a row using an element that becomes zero, which invalidates the algorithm.
  • Adding constants to rows: Row operations only allow adding or subtracting multiples of another row, not adding raw numbers to individual row entries.

Related linear algebra calculators

Related Calculators

More tools from Education

System of Equations CalculatorSolve a system of two or three linear equations using elimination or Cramer's rule. Detects unique solutions, no-solution systems, and infinite-solution systems with a plain-English reading.

Frequently asked questions

Reduced row echelon form is the unique simplest form of a matrix produced by row operations. In RREF, every pivot is 1, every pivot column has zeros elsewhere, and the pivots step down and to the right.

Rank counts the number of pivot rows in RREF. For a coefficient matrix, rank equals the number of independent equations. For an augmented system, comparing the rank of the coefficient matrix to the rank of the augmented matrix tells you whether the system is consistent.

Use 2x3 (for two equations in x and y) or 3x4 (for three equations in x, y, z). Enter each equation as one row: the coefficients of the variables in the left columns, and the right-hand side in the last column. The calculator reads the solution from RREF.

No solution: a row in RREF reads 0 = nonzero, which is impossible. Infinite solutions: the system has at least one free variable (a column without a pivot), so any value for that variable extends to a valid solution.

Reduced row echelon form is uniquely determined by the original matrix. Two different RREFs would imply contradictory pivot positions. This is what makes RREF useful for answering questions about a matrix at a glance.

Row echelon form (REF) only requires zeros below the pivots and a staircase shape. RREF goes further: pivots are exactly 1, and pivot columns have zeros above the pivot as well. Every matrix has a unique RREF.

Yes, reduced row echelon form can be computed for any matrix regardless of its dimensions (square, wide, or tall). The Gauss-Jordan algorithm applies the same row operations to any rectangular matrix to find its unique RREF.

A pivot is the first non-zero entry in a row of a matrix during row reduction. In reduced row echelon form (RREF), all pivots are scaled to exactly 1, and they are the only non-zero entries in their respective columns.