Skip to main content

RREF Calculator — Reduced Row Echelon Form with Step-by-Step Solutions

Last updated: May 2026 · Reviewed for accuracy · Free, no sign-up

Free online RREF calculator. Solve any matrix size (2×2 to 6×6), see every Gauss-Jordan elimination step explained in plain English, get exact fraction answers. No sign-up. Updated May 2026. Every calculation shows the complete Gauss-Jordan elimination process — use it as an rref calculator with steps to check your own work or understand each row operation.

100% Free No Sign-up Exact Rational Arithmetic Step-by-Step Solutions Mobile-Friendly BigInt Precision

Matrix Input

×

Tab / Arrow keys to navigate cells. Enter fractions as 1/2. Press Ctrl+Enter to calculate.

x₁
x₂
x₃
b
1
2
3

Exact Rational Arithmetic

BigInt-based fractions mean zero rounding errors. Where other calculators show 0.999999, we show 1.

Full Step-by-Step Solutions

Every row operation explained by name. Toggle verbose/terse mode. Expand or collapse individual steps.

Augmented Matrix Support

Classify systems as unique, infinite, or inconsistent. See parametric forms and free variables named.

Save, Share & Export

Share problems via URL. Save your last 10 calculations locally. Export solutions as LaTeX.

Quick Facts About This RREF Calculator

Full name
Reduced Row Echelon Form (RREF) Calculator
Method
Gauss-Jordan elimination — zeros above AND below each pivot
Arithmetic type
Exact BigInt rational arithmetic — no floating-point error
Matrix sizes supported
2×2 up to 6×6 (rows and columns independently selectable)
Augmented matrices
Yes — toggle Augmented mode to separate the b column
Step-by-step output
Every row operation named and shown (expandable per step)
Free to use
Yes — no sign-up, no account, no usage limits
Export formats
LaTeX export for homework and academic papers

What Is RREF (Reduced Row Echelon Form)?

Reduced Row Echelon Form (RREF) is a standardized form of a matrix obtained through Gauss-Jordan elimination. Every matrix has exactly one RREF — this is the uniqueness theorem that makes RREF the canonical form for matrix analysis. REF (Row Echelon Form) is not unique, but RREF is.

The Four RREF Conditions

  1. All-zero rows at the bottom. Any row consisting entirely of zeros must be below all non-zero rows.
  2. Leading entries are 1 (pivots). The first non-zero entry in each non-zero row is exactly 1.
  3. Staircase pattern. Each pivot is strictly to the right of the pivot in the row above.
  4. Zeros above and below each pivot. Every other entry in a pivot column is 0 — this is what distinguishes RREF from REF.

RREF is the most useful form for solving systems of linear equations because the solution can be read off directly, with no back-substitution required. It also reveals the rank, null space, and linear dependence relationships of the matrix.

Here is a simple example. The matrix A = [[2, 4, −2], [4, 9, −3], [−2, −3, 7]] has RREF:

RREF(A) = [ 1  0  0 ]
          [ 0  1  0 ]
          [ 0  0  1 ]

The RREF is the 3×3 identity matrix, which tells us A has rank 3 (full rank), is invertible, and the linear system Ax = b has a unique solution for every b. Use the calculator above to verify this and see every elimination step.

This RREF matrix calculator and row reduced echelon form calculator supports matrix sizes from 2×2 to 6×6. Every computation uses exact BigInt rational arithmetic — no floating-point rounding errors. Whether you need an RREF calculator with steps for a homework problem or a quick rank check, enter your matrix above and click Calculate RREF. Also see the Gauss-Jordan elimination calculator and the linear algebra basics guide.

How to Use This RREF Calculator

Three steps to get your exact RREF solution with full step-by-step explanation. For a complete walkthrough, see our step-by-step RREF tutorial, or use the matrix operations cheat sheet as a quick reference.

1

Enter Your Matrix

Set the dimensions using the row/column selectors or click a preset (2×2, 3×3, etc.). Click any cell and type your values. Use Tab or arrow keys to navigate. Enter fractions as "1/2". Negative numbers as "-3".

2

Set Options

Toggle "Augmented" on if your last column contains the constants of a linear system (the right-hand side b). Use "Load Example" to see pre-built educational matrices covering different solution types.

3

Calculate & Explore

Click "Calculate RREF". Gauss-Jordan steps appear below. Expand individual steps to see the full matrix state. Switch between Steps and Solution tabs. Copy LaTeX to use in your assignment.

Worked Example: Finding RREF of a 3×3 Matrix

Let's compute the RREF of A = [[0, 2, −1], [4, 0, 3], [−2, 1, 0]] step by step.

Step 0: Initial Matrix

The first column has 0 in row 1. Swap R₁ and R₂ to bring a non-zero entry to the pivot position.

[ 0   2  -1 ]
[ 4   0   3 ]
[-2   1   0 ]

Step 1: Swap R₁ ↔ R₂

Now the pivot column (column 1) has entry 4 in row 1. Scale R₁ → (1/4)R₁ to make the pivot equal 1.

[ 4   0   3 ]
[ 0   2  -1 ]
[-2   1   0 ]

Step 2: Scale R₁ → (1/4)R₁

Eliminate below: R₃ → R₃ + (1/2)R₁.

[ 1   0  3/4 ]
[ 0   2  -1  ]
[-2   1   0  ]

Step 3: R₃ → R₃ + 2R₁

Move to pivot column 2. Scale R₂ → (1/2)R₂.

[ 1   0  3/4 ]
[ 0   2  -1  ]
[ 0   1  3/2 ]

After all elimination steps:

RREF is the 3×3 identity. Rank = 3. Matrix is invertible.

[ 1   0   0 ]
[ 0   1   0 ]
[ 0   0   1 ]

Enter this matrix into the calculator above to see all intermediate steps with exact fraction arithmetic.

RREF vs. REF: What Is the Difference?

Both Row Echelon Form (REF) and Reduced Row Echelon Form (RREF) result from applying elementary row operations, but they differ in how far the elimination is carried. Understanding the difference is essential because many textbooks only go to REF, while this calculator always computes the full RREF.

REF (Row Echelon Form)

  • ✓ Zero rows at the bottom
  • ✓ Leading entries non-zero (not necessarily 1)
  • ✓ Staircase pattern of leading entries
  • ✗ Entries above pivots are NOT zeroed
  • ✗ Not unique — many valid REFs for one matrix
  • → Requires back-substitution to solve

RREF (Reduced Row Echelon Form)

  • ✓ Zero rows at the bottom
  • ✓ Leading entries = 1 (pivots)
  • ✓ Staircase pattern
  • ✓ Zeros above AND below every pivot
  • ✓ Unique — every matrix has exactly one RREF
  • → Solution readable directly from last column

The key insight: Gaussian elimination stops at REF (upper triangular form) and requires back-substitution. Gauss-Jordan elimination continues to RREF by also eliminating entries above each pivot. RREF takes more row operations but produces a unique, directly readable result.

For finding matrix inverses, determinants, and null spaces, RREF is the natural endpoint. Our Gauss-Jordan calculator and our comparison guide explain the difference in detail.

How to Compute RREF By Hand (Gauss-Jordan Algorithm)

The Gauss-Jordan algorithm applies these six steps in sequence, working left to right through the columns and top to bottom through the rows:

1

Identify the pivot column: the leftmost column with a non-zero entry in the current row or below.

2

Row swap: if the top entry of the pivot column is zero, swap the current row with a row below that has a non-zero entry in this column.

3

Scale: multiply the current row by 1/(pivot value) so the pivot becomes exactly 1.

4

Eliminate below: for every row below the current row, subtract the appropriate multiple of the current row to zero out its entry in the pivot column.

5

Eliminate above: for every row above the current row, subtract the appropriate multiple to zero out its entry in the pivot column. (This is what Gauss-Jordan adds over basic Gaussian elimination.)

6

Advance: move to the next row down and the next unprocessed column. Repeat from step 1 until all rows are processed.

Why Exact Arithmetic Matters in RREF

Floating-point arithmetic — the kind used by most websites and programming languages — represents numbers in binary. Many simple fractions (like 1/3, 1/7, or 1/10) have no exact binary representation, so they are rounded to the nearest representable value. In a single arithmetic operation, this rounding error is tiny. But in Gauss-Jordan elimination, each step uses the results of the previous step. Errors accumulate across dozens of operations, producing visibly wrong answers.

Other calculators (floating-point)

Row 2 pivot: 0.9999999999

Entry [2,3]: -6.93889e-18

RREF entry: 0.3333333334

This calculator (exact rational)

Row 2 pivot: 1

Entry [2,3]: 0

RREF entry: 1/3

Our solution: represent every number as an exact fraction using JavaScript's BigInt type for arbitrarily large integers. The fraction 1/3 is stored as the pair (numerator=1, denominator=3) — not as the decimal 0.333... Addition, multiplication, and division on these fractions are performed exactly, following the standard rules for rational arithmetic. The result of any calculation is always another exact fraction.

This approach is used in computer algebra systems (Mathematica, Maple, SymPy) for exactly this reason. For educational use — where students need to check their hand computation — exact answers are essential. See our linear algebra for students guide for more tips on checking your work. For algebraic expressions involving square roots — such as eigenvalues and vector norms — use the simplify radicals calculator to get exact simplified form.

Applications of RREF and Row Reduction

Row reduction to RREF is not just a homework exercise — it is the foundation for dozens of practical computations in mathematics, science, and engineering. For a structured introduction, see our matrix operations cheat sheet:

Solving Linear Systems

Every linear system Ax = b can be solved by reducing [A|b] to RREF. The pivot structure immediately reveals whether the solution is unique, infinite, or nonexistent. See our solving linear systems guide.

Finding Matrix Rank

The rank of A equals the number of pivots in RREF(A). Rank determines the dimension of the column space (image) and row space — fundamental in linear algebra.

Computing Matrix Inverses

Apply Gauss-Jordan to [A|I]. If A is invertible, [A|I] reduces to [I|A⁻¹]. Use our matrix inverse calculator to compute A⁻¹, or the determinant calculator to check invertibility.

Finding Null Space

The null space of A is found by solving Ax = 0. RREF identifies free variables, which parameterize the null space. Nullity = n − rank (rank-nullity theorem).

Checking Linear Independence

Arrange vectors as rows or columns of a matrix. RREF reveals whether they are linearly independent (no zero rows = independent) or dependent. For vector projections and angle checks, see the dot product calculator.

Basis for Column/Row Space

Pivot columns of A correspond to a basis for the column space. Pivot rows of RREF(A) form a basis for the row space.

Balancing Chemical Equations

Stoichiometry problems reduce to linear systems. For example, balancing aC₂H₆ + bO₂ → cCO₂ + dH₂O becomes Ax = 0 solved by RREF.

Computer Graphics

Transformation matrices for 3D graphics require inversion (computed via Gauss-Jordan) and rank checking. RREF underlies the matrix math in OpenGL and DirectX. Surface normals use the cross product calculator, and the matrix multiplication calculator handles the composition of transformations, while matrix transpose is essential for orthogonal matrices.

RREF Calculator for Any Matrix Size

This calculator handles every matrix size students encounter, from small 2×2 systems to larger 4×4 and 5×5 matrices. Use the size presets above the calculator for one-click switching.

2×2 RREF Calculator

Two-equation, two-variable systems. Classic linear algebra introduction. Result is always unique solution, infinite solutions, or no solution.

2×3 RREF Calculator

Two equations, three unknowns — one free variable guaranteed. Common in parametric solution problems.

3×3 RREF Calculator

Three-variable systems. Most common in undergraduate linear algebra courses. Includes the augmented 3×4 form for solving Ax=b.

3×4 RREF Calculator

Augmented matrix for three equations and three unknowns. Enter coefficients in columns 1–3 and constants in column 4.

4×4 RREF Calculator

Four-variable systems common in upper-division courses. Our exact rational arithmetic prevents the rounding errors that plague TI-84 and Casio results.

Up to 6×6 RREF Calculator

Custom sizes available via the row and column dropdowns. All sizes use the same BigInt exact arithmetic — no floating-point errors at any dimension.

Wondering how this compares to using the RREF function on a TI-84 or Casio calculator? The TI-84 uses floating-point arithmetic internally, which can produce rounding errors on fractions — this calculator uses exact rational arithmetic, so your answers are always precise fractions, never approximations like 0.9999999. Learn more in our RREF step-by-step tutorial.

Frequently Asked Questions

20 questions covering RREF, Gauss-Jordan, augmented matrices, and this calculator. For a full reference, see our FAQ page.

Built by a team committed to exact mathematics — learn about our methodology.

What is RREF (Reduced Row Echelon Form)?

RREF is a standardized form of a matrix produced by Gauss-Jordan elimination. A matrix is in RREF when: (1) all-zero rows are at the bottom, (2) each non-zero row has a leading 1 (pivot), (3) pivots step strictly right and down (staircase), and (4) every entry above and below each pivot is 0. RREF is unique for every matrix.

How is this RREF calculator different from others?

Most online RREF calculators use floating-point arithmetic, producing rounding errors like 0.9999999 instead of 1. This calculator uses BigInt-based exact rational arithmetic — every number is stored as a precise fraction. Results are mathematically exact, not approximations.

How do I enter fractions into the RREF calculator?

Type fractions directly: "1/2" for ½, "3/4" for ¾, "-2/3" for −⅔. Negative fractions work too. Decimals like "0.5" are also accepted and converted to exact fractions internally.

What is an augmented matrix?

An augmented matrix [A|b] combines the coefficient matrix A with the right-hand side vector b of a linear system. Enable the Augmented toggle to separate the last column visually. The calculator then classifies the solution as unique, infinitely many, or no solution.

What does the rank of a matrix tell you?

Rank equals the number of pivot columns in RREF. It equals the number of linearly independent rows (and columns). By the rank-nullity theorem, rank + nullity = n (number of columns). Full rank means the matrix has as many pivots as columns (unique solution if augmented, invertible if square).

What is Gauss-Jordan elimination?

Gauss-Jordan elimination is the algorithm to compute RREF. It applies three elementary row operations column by column: (1) swap rows to get a non-zero pivot, (2) scale the pivot row to make the pivot equal 1, (3) eliminate all entries above and below each pivot. The result is RREF.

Try the Gauss-Jordan elimination calculator →

What is the difference between RREF and REF?

Row Echelon Form (REF) zeros entries only below each pivot; entries above can be non-zero. Reduced Row Echelon Form (RREF) zeros entries both above AND below each pivot. REF is not unique; RREF is unique. RREF allows reading off the solution directly without back-substitution.

Can I use this calculator for linear systems with infinitely many solutions?

Yes. Enable Augmented mode and enter [A|b]. If the system has free variables, the calculator identifies them and shows the parametric solution with each free variable labeled. If the system is inconsistent (no solution), it detects the contradiction row [0 0 ... 0 | c≠0].

Is this RREF calculator free?

Yes, completely free. No sign-up, no account, no usage limits. All calculations run in your browser.

What matrix sizes does this calculator support?

The RREF calculator supports matrices from 1×1 to 6×6, with quick-select presets for 2×2, 2×3, 3×3, 3×4, and 4×4. Custom sizes can be set using the row and column dropdowns.

How do I find the inverse of a matrix?

Use the Matrix Inverse Calculator at rrefmatrixcalc.com/matrix/inverse. It applies Gauss-Jordan elimination to the augmented matrix [A|I] to find A⁻¹, showing every step. Alternatively, for a 2×2 matrix [[a,b],[c,d]], A⁻¹ = (1/(ad−bc)) · [[d,−b],[−c,a]].

Try the matrix inverse calculator →

What is the null space of a matrix?

The null space (kernel) of A is the set of all vectors x such that Ax = 0. Its dimension (nullity) equals n − rank(A) by the rank-nullity theorem. Free variable columns in RREF correspond to null space dimensions. Find a basis by solving Ax = 0 in augmented matrix form.

See the linear algebra basics guide →

Can I export the RREF solution as LaTeX?

Yes. After computing RREF, use the LaTeX export button to copy the full step-by-step solution in LaTeX format, suitable for pasting into academic papers, homework submissions, or LaTeX editors.

What is a pivot in linear algebra?

A pivot is the leading entry (first non-zero entry) in a row after row reduction. In RREF, every pivot equals exactly 1, and all other entries in its column are 0. The number of pivots equals the rank of the matrix. Pivot columns correspond to basic variables; non-pivot columns to free variables.

What does a zero row in RREF mean?

In the coefficient matrix alone, a zero row means the rows are linearly dependent and the matrix has rank less than the number of rows. In an augmented matrix [A|b]: if the zero row has a 0 on the right too, it adds no information (infinitely many solutions possible). If it has a non-zero right-hand side, the system is inconsistent (no solution).

How do I solve a system of equations with a matrix?

Write the system as an augmented matrix [A|b] — coefficients of each variable as columns, constants as the last column. Then apply Gauss-Jordan elimination (this calculator does it for you) to reach RREF. Read the solution from the last column, or identify free variables if infinitely many solutions exist.

See the solving linear systems guide →

Is the RREF of a matrix unique?

Yes. Every matrix has exactly one RREF, regardless of which sequence of row operations is used to reach it. This is the RREF uniqueness theorem (Theorem 1 in Lay's Linear Algebra, §1.2). This makes RREF a canonical form — useful for comparing matrices and verifying work.

What is a free variable in a linear system?

A free variable is a variable whose column has no pivot in RREF. Free variables can take any real value (they are parameters). Basic variables (pivot columns) are determined by the free variables. A system with k free variables has infinitely many solutions parameterized by k parameters.

Does row reduction change the solution set of a linear system?

No. Elementary row operations produce row-equivalent matrices, which have exactly the same solution set. This is the fundamental theorem justifying row reduction: transforming [A|b] to RREF does not change which vectors x satisfy Ax = b.

Can I use this calculator on my phone?

Yes. The RREF calculator is fully mobile-responsive. The matrix input grid adapts to smaller screens, and the step-by-step solution panel scrolls horizontally for wide matrices. All features work on iOS and Android browsers.