Eigenvalues and eigenvectors describe the directions a matrix leaves unchanged (aside from scaling) — a concept that shows up everywhere from vibration analysis and quantum mechanics to Google's PageRank algorithm and principal component analysis in statistics. This calculator solves for both directly from a 2×2 or 3×3 matrix you enter, showing the characteristic polynomial, the eigenvalues (real or complex), and a unit eigenvector for each.

How the solver works

The calculator first builds the characteristic polynomial det(A − λI) from the matrix's trace and determinant (and, for a 3×3 matrix, the sum of its principal 2×2 minors). For a 2×2 matrix this polynomial is a quadratic, solved directly with the quadratic formula. For a 3×3 matrix it's a cubic, solved with the same tested cubic solver used by the Cubic Equation Calculator — the characteristic polynomial of any 3×3 matrix is, after all, just a cubic equation in λ. Once the eigenvalues are known, the calculator finds an eigenvector for each one by row-reducing (A − λI) to find a nonzero vector in its null space, then scales that vector to unit length.

Why eigenvalues can be complex — and what repeated eigenvalues mean

Even a matrix built entirely from real numbers can have complex eigenvalues, whenever it rotates space rather than just stretching it along some real direction (the 90° rotation matrix in the examples above is the cleanest case). When that happens, the complex eigenvalues always arrive as a conjugate pair, just like the complex roots of a real polynomial. Separately, a matrix can have a repeated eigenvalue — the same λ satisfying the characteristic equation more than once. If that eigenvalue's eigenspace (the set of all its eigenvectors) is exactly as many dimensions wide as the repeat count, the matrix is still diagonalizable. If the eigenspace is narrower — only one independent direction even though the eigenvalue repeats twice or three times — the matrix is called defective, and the calculator's interpretation line flags this case specifically.

Where this shows up in practice

Eigenvalues measure how much a matrix stretches space along its eigenvector directions, which is why they appear across such a wide range of applications: a structure's natural vibration frequencies are the eigenvalues of its stiffness matrix, a Markov chain's long-run behavior is governed by the eigenvector tied to its largest eigenvalue, and principal component analysis in statistics ranks directions in a dataset by the eigenvalues of its covariance matrix. In every case, the same underlying question is being asked: which directions does this matrix treat as "special," and by how much does it scale each one?