Skip to content
MasterMath

Matrix Rank Calculator

The rank of a matrix: how many of its rows are genuinely independent, rather than combinations of the others.

Rank

—

Rank—
Dimensions—
Full rank?—
Linearly dependent rows—

How this was worked out

    The formula

    rank = number of non-zero rows after row reduction

    What it means

    Rank counts the dimensions the matrix actually spans. Reduce it to row echelon form and count the rows that have not collapsed to zero; each surviving row is a direction the matrix genuinely reaches.

    How to do it by hand

    1. Reduce the matrix using row operations
    2. Work down, using each row to clear the ones below
    3. Count the rows that are not all zeros
    4. The maximum possible rank is the smaller of the two dimensions

    What is worth knowing

    Rank is what decides whether a system of equations has a solution, and how many. The Rouché–Capelli theorem says a system is consistent exactly when the coefficient matrix and the augmented matrix have the same rank, and the solution is unique only when that rank equals the number of unknowns. Rank also equals the number of non-zero eigenvalues, and it is the reason 'full rank' matters so much in statistics: a design matrix that is not full rank means two of your variables are carrying the same information, and the model cannot separate them.

    Frequently asked questions

    What does the rank tell me?

    How many rows are linearly independent, which is how many dimensions the matrix genuinely spans.

    What is full rank?

    When the rank equals the smaller of the two dimensions. It means no row or column is redundant.

    How does rank relate to solving equations?

    A system has a solution only if the coefficient and augmented matrices share the same rank, and it is unique only if that rank equals the number of unknowns.

    Can the rank exceed the number of rows?

    No. It is capped by the smaller of the row count and the column count.