Algebra • Linear Algebra Flagship

Row Echelon Form (REF) & RREF Calculator

Transform square and rectangular matrices into Row Echelon Form (REF) and Reduced Row Echelon Form (RREF) with complete step-by-step elementary row operations, pivot identification, and rank verification.

Reviewed by Sanjay Samanta & Academic Review Board
Verified Gauss-Jordan Row Reduction Algorithms
Last Updated: September 2026
Matrix Calculator (A & B) Row Echelon Form (REF / RREF) Matrix Rank LU Decomposition Char Polynomial Eigenvalues & Vectors
Direct Answer & Overview
Verified Educational Guide

Row Echelon Form (REF) & RREF Overview

Row Echelon Form (REF) is a standardized staircase matrix format where all entries below leading pivot elements are zero. Reduced Row Echelon Form (RREF) further simplifies the matrix so every pivot equals 1 and is the sole non-zero entry in its entire column.

Primary Mathematical Formula Standard Mathematical Model
Standard Equation
ƒ(x)
Q.E.D.
REF: Leading entries form a descending staircase with zeros below. RREF: Leading pivots = 1, zeros both above and below each pivot.
Evaluated with exact mathematical formulation • Rigorously verified
Exact Formula
Input Parameters
Required
1
Matrix dimensions (Rows m × Columns n)
2
Matrix coefficients (real numbers or fractions)
Expected Outputs
Calculated
Row Echelon Form (REF) matrix
Reduced Row Echelon Form (RREF) matrix
Matrix rank (number of non-zero rows / pivots)
Step-by-step elementary row operations log
Worked Numerical Example
Instant Verification
Reduce matrix [[1, 2, 1], [2, 4, 3], [3, 6, 4]] to RREF
→ R₂ - 2R₁ → R₂, R₃ - 3R₁ → R₃ creates zeros in column 1. R₃ - R₂ → R₃ zeros row 3. Finally, R₁ - R₂ → R₁ clears above pivot 2.
RREF = [[1, 2, 0], [0, 0, 1], [0, 0, 0]] | Rank = 2

Row Echelon Form (REF) vs Reduced REF (RREF) Definitions

Gaussian elimination systematically simplifies matrices into standardized triangular structures. The two primary echelon representations are:

Row Echelon Form (REF)
  • All non-zero rows are strictly above all rows of zeros.
  • The leading entry (pivot) of a non-zero row is in a column strictly to the right of the leading entry of the row above it.
  • All entries in a column below a leading pivot are zero.
Reduced Row Echelon Form (RREF)
  • Satisfies all three REF criteria above.
  • Every leading pivot entry is scaled to exactly 1.
  • Each leading 1 is the only non-zero entry in its entire column (zeros both above and below).
  • RREF is mathematically unique for every matrix.

The Three Elementary Row Operations

Matrix row reduction preserves linear independence, row space, and solution sets through three algebraic operations:

1. Row Swap ($R_i \leftrightarrow R_j$)

Interchange the positions of row $i$ and row $j$. Used when the current pivot position contains a zero.

2. Scaling ($k \cdot R_i \rightarrow R_i$)

Multiply all entries in row $i$ by a non-zero scalar $k \neq 0$. Used to normalize a pivot entry to 1.

3. Addition ($R_i + k R_j \rightarrow R_i$)

Add a scalar multiple of row $j$ to row $i$. Used to eliminate (zero out) entries above and below pivots.

Gaussian & Gauss-Jordan Elimination Step-by-Step Algorithm

Two-Phase Reduction Process:
  1. Forward Elimination (to REF): Scan columns left to right. Locate the leftmost non-zero entry, swap rows if necessary to bring it to the pivot position, scale to 1 (optional for REF), and add multiples of the pivot row to all rows below to zero out the entire column under the pivot.
  2. Backward Substitution / Elimination (to RREF): Starting from the bottom-right pivot and moving upward and leftward, scale each pivot to 1, and add multiples of the pivot row to rows above to zero out all entries above each leading 1.

Matrix Rank, Pivot Columns & Free Variables

The echelon form immediately reveals fundamental geometric and algebraic dimensions of the matrix transformation:

Matrix Rank ($\text{rank}(A)$)

Equals the number of leading pivot entries (non-zero rows) in REF. Represents the dimension of the column space / row space.

Pivot Variables

Variables corresponding to columns that contain a leading pivot. These variables have fixed deterministic relationships.

Free Variables (Nullity)

Columns lacking a pivot correspond to free parameters ($t, s \in \mathbb{R}$). Nullity $= n - \text{rank}(A)$.

Solving Linear Systems & Parameterizing Infinite Solutions

For an augmented matrix $[A \mid \mathbf{b}]$, the RREF form directly classifies the system's solvability:

Unique Solution ($\text{rank}(A) = \text{rank}([A \mid \mathbf{b}]) = n$)
Every column of $A$ has a pivot. Values for all variables are read directly from the rightmost column of RREF.
Infinitely Many Solutions ($\text{rank}(A) = \text{rank}([A \mid \mathbf{b}]) < n$)
There are $n - \text{rank}(A)$ free variables. Express pivot variables in terms of arbitrary parameters $t_1, t_2$.
Inconsistent / No Solution ($\text{rank}(A) < \text{rank}([A \mid \mathbf{b}])$)
A row of the form $[0 \; 0 \; \dots \; 0 \mid c]$ with $c \neq 0$ appears, representing the impossible statement $0 = c$.

Graded Step-by-Step Numerical Solutions

Example 1 • 3x3 Matrix to RREF Standard Tier

Transform $A = \begin{pmatrix} 1 & 2 & 3 \\ 2 & 5 & 8 \\ 3 & 7 & 11 \end{pmatrix}$ to RREF

1. Forward elimination: $R_2 - 2R_1 \rightarrow R_2 \implies [0, 1, 2]$. $R_3 - 3R_1 \rightarrow R_3 \implies [0, 1, 2]$.

2. Zero out row 3: $R_3 - R_2 \rightarrow R_3 \implies [0, 0, 0]$. (REF reached with 2 pivots: $(1,1)$ and $(2,2)$).

3. Backward elimination: $R_1 - 2R_2 \rightarrow R_1 \implies [1, 0, -1]$.

RREF = $\begin{pmatrix} 1 & 0 & -1 \\ 0 & 1 & 2 \\ 0 & 0 & 0 \end{pmatrix}$, $\text{Rank} = 2$.

Common Pitfalls & Arithmetic Fraction Errors

Pitfall 1: Premature Column Clearing Before Identifying Pivots
Always clear entries strictly downward column-by-column during the forward phase. Attempting to clear above and below simultaneously without disciplined order causes newly created zeros to be overwritten in subsequent steps.
Pitfall 2: Neglecting Floating-Point Roundoff Near Zero
In computer calculations, values like $10^{-15}$ represent numerical noise that should be treated as exact zero. This calculator implements fraction arithmetic and tolerance thresholds ($|x| < 10^{-10} \rightarrow 0$) to guarantee exact pivot recognition.
Fact-Checked & Verified • Computational Accuracy Standards
Updated July 2026 • Editorial Policy
Authored By
Sanjay Samanta

Lead Developer & Founder of Basic Math Tools. Specializes in browser-native computational algorithms and applied mathematics.

Reviewed & Verified By
Academic Review Board

Mathematics & curriculum specialists. Audited against standard algebraic and arithmetic principles.

Found an error or have an improvement suggestion? Report a calculation issue

Frequently Asked Questions

What is the difference between Row Echelon Form (REF) and Reduced Row Echelon Form (RREF)?
In Row Echelon Form (REF), all non-zero rows are above any all-zero rows, and the leading entry (pivot) of each non-zero row is strictly to the right of the leading entry of the row above it, with zeros everywhere below each pivot. In Reduced Row Echelon Form (RREF), every leading pivot is scaled to exactly 1, and it is the only non-zero entry in its entire column (zeros both below and above each pivot).
What are the three elementary row operations used in Gaussian elimination?
1. Row Swap (R_i ↔ R_j): Interchanging two rows. 2. Scalar Multiplication (k · R_i → R_i, where k ≠ 0): Multiplying all entries in a row by a non-zero constant. 3. Row Addition/Substitution (R_i + k · R_j → R_i): Adding a scalar multiple of one row to another row.
Is the Row Echelon Form (REF) of a matrix unique?
No, a matrix can have infinitely many different Row Echelon Forms depending on which row operations and scalar multiples are chosen. However, the Reduced Row Echelon Form (RREF) is mathematically unique for every matrix.
How do you determine the rank of a matrix from its echelon form?
The rank of a matrix equals the total number of non-zero rows (or equivalently, the number of pivot columns/leading ones) present in its Row Echelon Form.
How does RREF solve systems of linear equations?
When applied to an augmented matrix [A | b], RREF reduces the coefficient matrix A to identity-like columns, allowing each variable’s value to be read directly from the right-hand column without back-substitution.

Related Tools

Matrix Inverse Calculator

Algebra

Matrix Rank Calculator

Algebra

LU Decomposition Calculator

Algebra

Matrix Calculator

Algebra

Reduced Row Echelon Form (RREF) Calculator

Algebra

Characteristic Polynomial Calculator

Algebra

Cookie & Privacy Notice

We use essential cookies for calculator preferences and third-party advertising cookies (including Google AdSense) to keep all math solvers 100% free. Learn more in our Privacy Policy.

Preferences