What is the determinant of a matrix?

The determinant is a single number computed from a square matrix that encodes key geometric and algebraic properties. A non-zero determinant means the matrix is invertible (full rank) and represents a transformation that does not collapse space. A zero determinant means the matrix is singular — it maps some non-zero vectors to zero, making the transformation irreversible. Geometrically, |det(A)| is the factor by which the transformation scales areas (2D) or volumes (3D).

How does Gaussian elimination find the determinant?

The algorithm reduces the matrix to upper-triangular form U by subtracting multiples of each pivot row from the rows below it. Because these row operations do not change the absolute value of the determinant (only row swaps negate it), the determinant of the original matrix equals the product of the diagonal entries of U, multiplied by (−1) for every row swap performed. This is much cheaper than cofactor expansion for large matrices: Gaussian elimination is O(n³) vs O(n!) for naive cofactor recursion.

What is partial pivoting and why does it matter?

Partial pivoting means selecting the largest absolute value in the current column as the pivot before each elimination step. Without pivoting, a near-zero pivot causes catastrophic cancellation — tiny floating-point errors get amplified, producing a wildly wrong result. Choosing the largest pivot keeps the multipliers below 1 in magnitude, bounding numerical error growth. This calculator always uses partial pivoting, so results are numerically stable even for ill-conditioned matrices.

What does a determinant of zero mean?

A zero determinant means the matrix is singular. Its columns (or rows) are linearly dependent — at least one column can be expressed as a combination of the others. Consequences include no matrix inverse existing, the linear system Ax = b having either no solution or infinitely many, and the transformation mapping the full space onto a lower-dimensional subspace (a line for 2D, a plane for 3D, etc.).

How is the 2×2 determinant formula derived?

For a 2×2 matrix with entries [a, b; c, d], the determinant is ad − bc. This comes directly from one step of elimination: multiply row 1 by c/a and subtract from row 2, giving upper-triangular form [a, b; 0, d − bc/a]. The product of the diagonal is a × (d − bc/a) = ad − bc. The formula is easy to remember: multiply the main diagonal and subtract the anti-diagonal product.

Does the order of rows or columns matter?

Yes — swapping any two rows (or two columns) flips the sign of the determinant. If you swap rows twice, the sign returns to its original value. This is why the algorithm tracks a sign variable that starts at +1 and multiplies by −1 for each row swap. The absolute value |det(A)| is unchanged by reordering, but the signed value — important for orientation in geometry — changes with each swap.

Is any data sent to a server?

No. Every calculation — including all elimination steps — runs entirely in your browser using JavaScript. Nothing is uploaded or stored.

Matrix Determinant Calculator

A matrix determinant calculator that handles 2×2 through 6×6 matrices and shows you every step of the computation, not just the final number. Built for students tackling linear algebra, engineers checking system solvability, and anyone who wants to understand exactly why a determinant has the value it does.

How it works

The calculator uses Gaussian elimination with partial pivoting — the standard numerically stable algorithm for computing determinants.

Starting from the original matrix A, the algorithm:

Finds the largest absolute value in the current column (the pivot) and swaps it into the leading position. Each swap multiplies the determinant by −1, so the algorithm tracks a sign variable.
Subtracts a scalar multiple of the pivot row from every row below it, driving those column entries to zero. These row-addition operations do not change the determinant.
Repeats for the next column until the matrix is upper-triangular (U).
Computes the determinant as:

det(A) = sign × U[1,1] × U[2,2] × … × U[n,n]

where sign is +1 or −1 depending on how many row swaps were needed.

If any diagonal entry of U is zero (after pivoting), the matrix is singular and det = 0. The calculator reports this immediately and stops eliminating further.

Why Gaussian elimination rather than cofactor expansion?

Cofactor expansion along a row or column is the formula you often see first in textbooks. For a 3×3 matrix it is perfectly practical — six multiplications — but for a 5×5 matrix it requires 120 multiplications and for 6×6 it reaches 720. Gaussian elimination is O(n³): a 6×6 needs at most ~72 multiply–add pairs. More importantly, partial pivoting keeps the arithmetic numerically stable, whereas cofactor expansion on an ill-conditioned matrix can accumulate large cancellation errors.

Worked example — 3×3 matrix

Take the matrix:

A = | 2  -1   3 |
    | 4   5  -2 |
    | 1   3   7 |

Step 1 — Identify pivot in column 1. Largest absolute value is 4 (row 2). Swap rows 1 and 2; sign flips to −1.

→ | 4   5  -2 |
  | 2  -1   3 |
  | 1   3   7 |

Step 2 — Eliminate below pivot 4.

R2 ← R2 − (2/4)·R1 = R2 − 0.5·R1
R3 ← R3 − (1/4)·R1 = R3 − 0.25·R1

→ | 4   5   -2  |
  | 0  -3.5  4  |
  | 0   1.75  7.5|

Step 3 — Pivot in column 2: −3.5 (row 2). No swap needed.

Step 4 — Eliminate R3 below pivot −3.5.

R3 ← R3 − (1.75/−3.5)·R2 = R3 + 0.5·R2

U = | 4   5   -2  |
    | 0  -3.5   4  |
    | 0   0    9.5 |

Step 5 — Final answer. det(A) = sign × 4 × (−3.5) × 9.5 = −1 × (−133) = 133

You can verify: 133 ≠ 0, so A is invertible and full-rank.

Matrix type	det	Invertible?
Identity n×n	1	Yes
Singular (rows/cols linearly dependent)	0	No
Orthogonal rotation matrix	±1	Yes
Scaled identity k·I	kⁿ	Yes (if k ≠ 0)

Formula note

The relationship det(AB) = det(A) · det(B) holds for all square matrices of the same size. This means the determinant is a multiplicative homomorphism from the group of invertible matrices to the non-zero reals — a core reason it appears throughout group theory, differential geometry, and multivariate calculus (the Jacobian determinant governs how integration measures transform).