What the calculator does
Choose an operation, enter one or two matrices, and press Calculate.
| Operation | What you get |
|---|---|
| Determinant | det(A), by row reduction to triangular form |
| Inverse | A⁻¹ by Gauss–Jordan elimination, or an explanation if A is singular |
| RREF | the reduced row echelon form, with every row operation |
| Rank | the number of pivots, the dimension of A’s row and column space |
| Eigenvalues | the characteristic polynomial, eigenvalues and eigenvectors |
| Transpose, trace | Aᵀ and the sum of the diagonal |
| A + B, A − B, A × B | matrix arithmetic, with size checks |
How to use it
- Pick the operation. Operations that need a square matrix lock the grid to a square shape.
- Set the number of rows and columns, then type the entries. Integers, decimals and fractions like −3/4 all work.
- Empty cells are reported as errors rather than treated as zero. To fill every empty cell with 0, use Fill empty cells with 0.
The formulas
Determinant
For a 2 × 2 matrix:
For larger matrices, the calculator uses row reduction: adding a multiple of one row to another leaves the determinant unchanged, and swapping two rows changes its sign. Once the matrix is upper triangular, the determinant is the product of the diagonal entries. This takes about n³ operations, compared with n! for cofactor expansion.
Inverse
Write the augmented matrix [A | I] and row-reduce. If the left half becomes the identity, the right half is A⁻¹:
For a 2 × 2 matrix this gives the familiar formula
Eigenvalues
A number λ is an eigenvalue of A if Av = λv for some non-zero vector v. That happens exactly when A − λI is singular:
The left side is the characteristic polynomial, of degree n. Its roots are the eigenvalues, and for each eigenvalue, the solutions of (A − λI)v = 0 are its eigenvectors.
Worked example
Find the determinant of
- Swap rows 1 and 3, so the first pivot is 1. This keeps the arithmetic simple, but it changes the sign of the determinant.
- Eliminate below the first pivot. Subtract 2 × row 1 from row 2 to get (0, −8, −11), and 2 × row 1 from row 3 to get (0, −11, −9).
- Eliminate below the second pivot. Subtract 11/8 × row 2 from row 3 to get (0, 0, 49/8).
- Multiply the diagonal and correct the sign. det(A) = −(1)(−8)(49/8) = 49.
The calculator gives det(A) = 49, with the same row operations in its working. Cofactor expansion along the first row confirms it: 2(0·5 − (−1)·4) + 3(2·5 − (−1)·1) + 1(2·4 − 0·1) = 8 + 33 + 8 = 49.
Common mistakes
- Multiplying entry by entry. Matrix multiplication combines rows of A with columns of B. Entry-by-entry multiplication is a different operation.
- Assuming AB = BA. Matrix multiplication is generally not commutative, and the two products may not even have the same size.
- Forgetting the sign change from a row swap when computing a determinant by row reduction.
- Scaling a row and forgetting the determinant changes. Multiplying a row by k multiplies the determinant by k.
- Trusting a decimal determinant near zero. With rounded arithmetic, a singular matrix can show a tiny non-zero determinant. Exact arithmetic avoids this.
Practical applications
- Systems of linear equations. A system Ax = b has a unique solution exactly when A is invertible.
- Computer graphics. Rotations, scalings and projections are matrix multiplications.
- Physics and engineering. Eigenvalues give natural frequencies of vibrating structures and principal stresses.
- Data science. Principal component analysis finds the eigenvectors of a covariance matrix.
- Markov chains. Long-run probabilities are an eigenvector for eigenvalue 1.
Assumptions and limitations
Matrices can be up to 8 × 8 with rational entries. Determinants, inverses, ranks and reduced forms are exact. Eigenvalues are exact when they are rational or quadratic surds; otherwise they are computed numerically. Eigenvectors are exact for rational eigenvalues. For simple irrational or complex eigenvalues they are computed numerically and checked; for repeated irrational eigenvalues they are not shown, because floating-point arithmetic cannot reliably determine the dimension of the eigenspace.