Eigenvalues
det(λI − A) = 0The roots become the diagonal entries of D.
Enter real integers, decimals, or scientific notation. Complex eigenvalues and eigenvectors are calculated when necessary.
Enter a valid matrix to test whether it has a complete eigenbasis.
det(λI − A) = 0The roots become the diagonal entries of D.
(A − λI)v = 0Choose enough independent eigenvectors to form the columns of P.
A = PDP⁻¹ ⇔ D = P⁻¹APEach diagonal entry of D must match the eigenvalue of the same column of P.
P, D, P⁻¹, and a reconstruction check.For A = [[4,1],[2,3]], the characteristic equation is λ² − 7λ + 10 = 0, so the eigenvalues are 5 and 2. Corresponding eigenvectors are proportional to [1,1]ᵀ and [1,−2]ᵀ.
P = [[1,1],[1,−2]], D = diag(5,2), and A = PDP⁻¹
The identity matrix is diagonalizable because its repeated eigenspace has full dimension. By contrast, [[2,1],[0,2]] has only one eigenvector direction and is defective.
The real rotation matrix [[0,−1],[1,0]] is not diagonalizable over ℝ, but it is diagonalizable over ℂ with eigenvalues i and −i.
The columns of P define an eigenvector coordinate system. The diagonal matrix D describes the same transformation in that basis: each coordinate is multiplied independently by its eigenvalue. The inverse P⁻¹ converts ordinary coordinates into the eigenbasis.
A repeated eigenvalue is not automatically a problem. Compare its algebraic multiplicity with its geometric multiplicity, the eigenspace dimension. A shortfall makes the matrix defective.
It means finding an invertible P and diagonal D such that A = PDP⁻¹. The columns of P are eigenvectors, and the corresponding eigenvalues appear in D.
No. An n × n matrix needs n linearly independent eigenvectors over the chosen number field.
It finds each eigenspace by complex row reduction and adds their dimensions. The matrix is diagonalizable when that total equals the matrix size.
Yes. Nonreal eigenvalues rule out a real diagonal matrix but may still supply a complete complex eigenbasis.
Eigenvectors may be rescaled or reordered. The same rescaling or ordering must be reflected in the matching columns of P and diagonal entries of D.
It is the largest entrywise difference between A and PDP⁻¹, divided by the largest magnitude used for scale. Small nonzero values are expected from floating-point rounding.
Yes. Parsing, calculation, copying, and text-file creation happen locally in your browser. This page’s calculator code does not transmit or store matrix entries.
Last reviewed: August 5, 2026 by the Starlight Tools editorial team. The diagonalization condition and construction were checked against MIT Linear Methods lecture notes on diagonalization.
The calculator accepts finite real entries with magnitude no greater than 10⁹⁰ and matrices of size 2×2 or 3×3. It uses double-precision floating-point arithmetic, groups numerically indistinguishable roots with a relative tolerance, and normalizes eigenvectors for readable output. Nearly repeated eigenvalues and nearly defective matrices are sensitive to rounding; use exact or high-precision software when a proof or research-grade result is required.