Compute eigenvalues of square matrices with step-by-step explanations.
For a 2×2 matrix
Setting expands to a quadratic:
Solved with the quadratic formula. The discriminant determines whether eigenvalues are real () or complex ().
For a 3×3 matrix
The characteristic polynomial is a degree-3 (cubic) equation:
This calculator solves it using Cardano's method (depressed cubic). Three cases arise: one real root (positive discriminant), a repeated real root (zero discriminant), or three distinct real roots (negative discriminant — the casus irreducibilis requiring trigonometric solution).
For n > 3 matrices
No closed-form formula exists (Abel–Ruffini theorem). This calculator uses the QR algorithm: iteratively decomposing and updating until the matrix converges to (quasi-)triangular form, reading eigenvalues from the diagonal.
Principal Component Analysis (PCA)
Eigenvalues of the covariance matrix rank the importance of each principal component. The largest eigenvalue corresponds to the direction of greatest variance in the data.
Google PageRank
PageRank is the dominant eigenvector of the web's link-transition matrix, corresponding to eigenvalue 1. The power method iteratively finds this eigenvector.
Quantum Mechanics
Observable quantities (energy, momentum, spin) are eigenvalues of Hermitian operators. Schrödinger's equation is an eigenvalue problem where E is the energy eigenvalue.
Structural Engineering
Natural frequencies of vibration of a structure are square roots of eigenvalues of (mass-stiffness system). Engineers must ensure these don't match external forcing frequencies to avoid resonance.
| Matrix Type | Definition | Eigenvalue Property |
|---|---|---|
| Symmetric | All eigenvalues are real | |
| Orthogonal | (on unit circle) | |
| Positive Definite | All eigenvalues | |
| Skew-Symmetric | Purely imaginary or zero | |
| Diagonal | Off-diagonal entries = 0 | Eigenvalues are the diagonal entries |
| Idempotent | Each eigenvalue is 0 or 1 | |
| Nilpotent | All eigenvalues are 0 |
In 1998, most search engines ranked pages by counting how many times a keyword appeared. Type "best pizza" and the page mentioning pizza the most floated to the top. Predictably, people gamed it — stuffing invisible text into pages to fake relevance. The results were awful, and everyone in the industry knew it.
Larry Page framed the problem differently: which pages does the web itself consider important, based on which other trusted pages link to them? A link from a respected site should count for more than a hundred links from spam. Authority propagates through the network. So the question became: what does the link structure of the entire web say about each page's importance?
The answer is an eigenvector. Not as a metaphor — PageRank literally computes the principal eigenvector of a matrix representing the web's link graph. Eigenvalues aren't abstract linear algebra. They're the reason a Stanford PhD project became the most valuable company in the world.
Most matrix transformations rotate vectors — they change both magnitude and direction. But for some special vectors, applied to some matrices, the direction stays the same. The transformation only stretches or shrinks them. Those vectors are eigenvectors. The stretch factor is the eigenvalue:
A is the matrix. x is the eigenvector. λ (lambda) is the eigenvalue — the scalar factor. If λ = 3, the transformation triples the vector's length while keeping its direction. If λ = −1, it reverses direction. If λ = 0, the vector collapses to zero entirely, meaning that direction gets annihilated — which, as it turns out, connects directly to why singular matrices have zero determinants.
Clearest physical analogy: a rubber band stretched along its axis. Pull it lengthwise and it gets longer — same direction, different magnitude. That's the eigenvector direction. Pull it at an angle and everything rotates. Eigenvectors are the axes where rotation doesn't happen.
Rearranging the eigenvalue equation gives . For a non-trivial solution (anything other than x = 0), the matrix must be singular. A matrix is singular when its determinant is zero:
This is the characteristic equation. Its roots are the eigenvalues. Work through a concrete 2×2 example:
Eigenvalues: λ = 3 and λ = 2. Substituting each back to find eigenvectors:
| Eigenvalue | Eigenvector | Geometric meaning |
|---|---|---|
| x-axis triples in length under A | ||
| diagonal direction doubles in length |
Both eigenvectors survive the transformation pointing in the same direction. Every other input vector rotates. These two directions are the "natural axes" of this particular transformation.
PageRank: Represent each web page as a node and each link as a directed edge. Build a matrix M where entry is the fraction of page j's authority passed to page i. The importance vector v we're looking for must satisfy — the eigenvector equation with λ = 1. Brin and Page's original 1998 paper is explicit: PageRank is the stationary distribution of a random walk on the web graph, which is the principal eigenvector of M. The algorithm that computes it — power iteration, multiplying M by an estimate repeatedly until it converges — is the same method used in numerical linear algebra courses today.
Bridge resonance: Every physical structure has natural frequencies — eigenvalues of its stiffness-to-mass ratio matrix. When an external force matches a natural frequency, energy accumulates instead of dissipating. The Tacoma Narrows Bridge collapsed in November 1940, four months after opening, because wind vortices excited one of its natural frequencies. Modern civil engineers compute structural eigenvalues before construction to ensure no expected load — traffic, wind, earthquake — can excite a resonant mode. A bridge that passes eigenvalue analysis doesn't get built with a dangerous frequency sitting in the middle of the wind spectrum.
Principal Component Analysis: Machine learning models often work with thousands of features — pixel values, sensor readings, gene expression levels. PCA reduces this to the most informative dimensions by computing eigenvectors of the data's covariance matrix. The eigenvector with the largest eigenvalue points in the direction of greatest variance. The second-largest points in the next most informative direction, perpendicular to the first. In face recognition, these eigenvectors are literally called "eigenfaces" — the abstract features that distinguish one face from another, compressed into a handful of numbers per image.
The common thread: all three systems ask "what are the stable, natural directions in this transformation?" Eigenvalues answer that question — in web graphs, physical structures, and high-dimensional data alike.
A 2×2 matrix with real entries can produce complex eigenvalues. That's not a calculation error — it means something specific: the transformation involves rotation, not just scaling. The imaginary part gives the rotation frequency; the real part tells you whether the rotation spirals inward (stable), outward (unstable), or stays circular (neutral).
In control systems and dynamics, this matters enormously. Complex eigenvalues with negative real parts mean oscillations die out — the system stabilizes. Positive real parts mean instability grows over time. The Tacoma Narrows Bridge, mathematically, had eigenvalues with a real part that the wind shifted from slightly negative to slightly positive. That transition from stable to unstable took under an hour to destroy the bridge.
There's a clean connection to the matrix determinant: the determinant equals the product of all eigenvalues. If any eigenvalue is zero, the determinant is zero — the matrix is singular. The matrix multiplication article shows how transformations compose; eigenvalues tell you what survives that composition unchanged.
The equation requires both sides to be the same type of vector. If A is m×n with m ≠ n, the input is an n-vector but the output is an m-vector — they can't be equal. Square matrices map a space to itself, which is the prerequisite for a vector to emerge from the transformation still pointing the same way. Non-square matrices have singular value decompositions (SVD) instead, which is a related but different concept.
No — any scalar multiple of an eigenvector is also an eigenvector. If x is an eigenvector, so is 2x, −x, or 0.001x. What's unique is the direction. In PCA and most applications, eigenvectors are normalized to unit length to remove the ambiguity. An n×n matrix has exactly n eigenvalues counting multiplicity (though some may be complex or repeated), and each eigenvalue has at least one associated eigenvector direction.
A symmetric matrix with all positive eigenvalues is called positive definite. In optimization, the Hessian matrix (second derivatives of a loss function) at a critical point is positive definite if and only if the point is a local minimum. All-negative eigenvalues mean a local maximum; mixed signs mean a saddle point. This is exactly how gradient descent methods check whether they've found a genuine minimum — and why deep learning loss landscapes, with their many saddle points, are harder to optimize than convex problems.
For 2×2 and 3×3 matrices, the characteristic polynomial is solvable by hand. Larger matrices use numerical methods: the QR algorithm repeatedly factors the matrix into Q and R components until eigenvalues appear on the diagonal, typically in dozens of iterations. Power iteration (repeatedly multiplying a random vector by the matrix) finds the dominant eigenvector — this is essentially what PageRank's early implementation did. For a 1,000×1,000 matrix, computing all eigenvalues symbolically is impractical; numerically it takes seconds on modern hardware.
Convert matrices to Reduced Row Echelon Form with step-by-step row operations. Perfect for linear algebra.
Multiply two matrices with step-by-step solutions. Learn matrix multiplication rules and properties.
Compute 3D vector cross product with step-by-step determinant expansion, magnitude, and right-hand rule direction.
Solve quadratic equations ax²+bx+c=0 using the quadratic formula with step-by-step solutions and discriminant analysis.