Characteristic equation
det(λI − A) = 0Its roots are the eigenvalues. A 2×2 matrix gives a quadratic and a 3×3 matrix gives a cubic.
Enter real integers, decimals, or scientific notation. Complex eigenpairs are supported even though matrix entries must be real.
det(λI − A) = —Enter a valid matrix to calculate its eigenpairs.
det(λI − A) = 0Its roots are the eigenvalues. A 2×2 matrix gives a quadratic and a 3×3 matrix gives a cubic.
(A − λI)v = 0, v ≠ 0For each eigenvalue, the null space of A − λI supplies one or more independent eigenvectors.
Av = λvThe calculator reports max|Av − λv|. A value near zero confirms the displayed eigenpair to working precision.
For A = [[4,1],[2,3]], the characteristic equation is:
det(λI − A) = (λ − 4)(λ − 3) − 2 = λ² − 7λ + 10 = 0
The roots are λ = 5 and λ = 2. Solving (A − 5I)v = 0 gives a direction proportional to [1,1]; solving (A − 2I)v = 0 gives one proportional to [1,−2].
If an eigenvalue appears more than once, compare algebraic multiplicity with the number of independent eigenvectors. A shortfall means the matrix is defective.
A real rotation matrix such as [[0,−1],[1,0]] has eigenvalues i and −i, with complex eigenvectors.
An eigenvector identifies a direction that a linear transformation does not turn away from itself in real or complex vector space. Its eigenvalue is the scale factor: magnitude greater than 1 expands, magnitude below 1 contracts, a negative real value reverses direction, and a complex value combines scaling with phase rotation.
Algebraic multiplicity is the number of times an eigenvalue occurs as a characteristic-polynomial root. Geometric multiplicity is the dimension of its eigenspace. A matrix is diagonalizable over the complex numbers when the total number of independent eigenvectors equals its size.
For a square matrix A, a nonzero vector v is an eigenvector if Av = λv. The scalar λ is its eigenvalue.
It forms det(λI − A) and solves the resulting quadratic or cubic. It scales the input matrix first to reduce overflow and underflow risk, then scales the roots back.
Yes. Nonreal roots occur as complex-conjugate pairs for real matrices. The associated eigenvectors generally have complex components too.
Algebraic multiplicity counts repeated characteristic roots. Geometric multiplicity counts independent eigenvectors for that root, or equivalently the dimension of null(A − λI).
No. A repeated eigenvalue can have fewer independent eigenvectors than its algebraic multiplicity. Such a matrix is defective and is not diagonalizable.
Decimal arithmetic, cubic roots, and row reduction use finite binary floating-point numbers. A small residual is expected; nearly repeated or ill-conditioned eigenpairs can have larger sensitivity.
Yes. Parsing, calculation, copying, and text-file creation occur 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. Definitions and the det(λI − A) convention were checked against the NIST Digital Library of Mathematical Functions, §3.2(iv).
The calculator accepts finite real entries with magnitude no greater than 10⁹⁰ and matrices of size 2×2 or 3×3. It groups numerically indistinguishable roots using a relative tolerance and computes eigenspaces by complex row reduction. For exact symbolic proofs, high-precision research, or safety-critical engineering, verify results with appropriate specialist software.