Eigenvalue Calculator
Calculate eigenvalues and eigenvectors of a square matrix with step-by-step work. Enter values for instant results with step-by-step formulas.
Reviewed for accuracy by Manoj Kumar, Mathematics Educator
Eigenvalue Calculator
Calculator
Adjust values & calculateEnter your values below. Every result is computed in your browser — no data is sent to any server.
Formula: det(A - lambda * I) = 0
Worked example — Eigenvalues: 5, 2 | Trace = 7 = 5+2 | Det = 10 = 5*2
Formula
det(A - lambda * I) = 0
Eigenvalues are found by solving the characteristic equation, where A is the input matrix, lambda represents the eigenvalue, and I is the identity matrix. The determinant is expanded into a polynomial whose roots are the eigenvalues.
Worked Examples
Example 1: 2x2 Matrix Eigenvalues
Problem:Find the eigenvalues of A = [[4, 1], [2, 3]].
Solution:Characteristic polynomial: det(A - lambda*I) = (4-lambda)(3-lambda) - (1)(2) = lambda^2 - 7*lambda + 10 Using quadratic formula: lambda = (7 +/- sqrt(49-40)) / 2 = (7 +/- 3) / 2 lambda_1 = 5, lambda_2 = 2 Eigenvector for lambda=5: (A-5I)v=0 => [-1,1; 2,-2]v=0 => v1 = (1, 1) Eigenvector for lambda=2: (A-2I)v=0 => [2,1; 2,1]v=0 => v2 = (1, -2)
Result:Eigenvalues: 5, 2 | Trace = 7 = 5+2 | Det = 10 = 5*2
Example 2: Complex Eigenvalues
Problem:Find the eigenvalues of A = [[0, -1], [1, 0]] (rotation matrix).
Solution:Characteristic polynomial: lambda^2 + 1 = 0 Discriminant = 0 - 4 = -4 (negative, so complex roots) lambda = (0 +/- sqrt(-4)) / 2 = +/- i lambda_1 = i, lambda_2 = -i
Result:Eigenvalues: +i, -i | This is a 90-degree rotation matrix with purely imaginary eigenvalues
Frequently Asked Questions
What are eigenvalues and why are they important?
Eigenvalues are special scalar values associated with a square matrix that indicate how the matrix stretches or compresses space along particular directions called eigenvectors. When you multiply a matrix A by one of its eigenvectors v, the result is simply a scalar multiple of v: Av = lambda * v, where lambda is the eigenvalue. Eigenvalues are fundamental in linear algebra because they reveal intrinsic properties of linear transformations. They determine matrix stability, describe natural frequencies of vibrating systems, and enable dimensionality reduction techniques like Principal Component Analysis. Nearly every branch of applied mathematics and engineering relies on eigenvalue analysis for understanding system behavior.
How do you find eigenvalues of a matrix?
To find eigenvalues, you solve the characteristic equation det(A - lambda * I) = 0, where A is the matrix, lambda is the unknown eigenvalue, and I is the identity matrix. For a 2x2 matrix, this produces a quadratic equation that can be solved with the quadratic formula. For a 3x3 matrix, you get a cubic equation solvable via Cardanos formula or trigonometric methods. For larger matrices, analytical solutions become impractical, so numerical algorithms like the QR algorithm, power iteration, or Jacobi method are used instead. Eigenvalue Calculator handles 2x2 and 3x3 matrices analytically, providing exact results through direct polynomial root-finding methods.
What is the characteristic polynomial of a matrix?
The characteristic polynomial is the polynomial equation obtained by computing det(A - lambda * I), where A is the matrix, lambda is a variable, and I is the identity matrix. For a 2x2 matrix [[a,b],[c,d]], the characteristic polynomial is lambda^2 - (a+d)*lambda + (ad-bc), which equals lambda^2 - trace * lambda + determinant. The roots of the characteristic polynomial are the eigenvalues. The Cayley-Hamilton theorem states that every matrix satisfies its own characteristic polynomial, meaning if you substitute the matrix itself into the polynomial, you get the zero matrix. This theorem has important applications in computing matrix powers and matrix exponentials efficiently.
What are eigenvectors and how do they relate to eigenvalues?
An eigenvector is a nonzero vector that, when multiplied by the matrix, only gets scaled by a constant factor (the eigenvalue) without changing direction. For each eigenvalue lambda, the corresponding eigenvectors are found by solving the homogeneous system (A - lambda * I)v = 0. The set of all eigenvectors for a given eigenvalue, together with the zero vector, forms a subspace called the eigenspace. Eigenvectors corresponding to distinct eigenvalues are always linearly independent. If a matrix has n distinct eigenvalues in n-dimensional space, its eigenvectors form a basis, and the matrix can be diagonalized as A = PDP^(-1), where D is the diagonal matrix of eigenvalues.
When does a matrix have complex eigenvalues?
A matrix has complex eigenvalues when its characteristic polynomial has a negative discriminant, meaning the roots involve square roots of negative numbers. For a 2x2 matrix, this occurs when (trace)^2 < 4 * determinant. Complex eigenvalues of real matrices always come in conjugate pairs: if a + bi is an eigenvalue, then a - bi is also an eigenvalue. Geometrically, complex eigenvalues indicate that the linear transformation involves rotation rather than pure stretching. The real part of the eigenvalue relates to scaling, while the imaginary part determines the rotation angle. Symmetric real matrices always have real eigenvalues, so complex eigenvalues only arise from non-symmetric matrices.
What is the relationship between eigenvalues and matrix properties?
Eigenvalues encode several important matrix properties. The trace of a matrix (sum of diagonal entries) equals the sum of all eigenvalues. The determinant equals the product of all eigenvalues. A matrix is singular (non-invertible) if and only if it has at least one zero eigenvalue. The matrix is positive definite if and only if all eigenvalues are positive. The spectral radius (largest absolute eigenvalue) determines the convergence rate of iterative methods. For differential equations, eigenvalue signs determine stability: all negative real parts mean the system is stable, any positive real part means instability. These connections make eigenvalue analysis a powerful diagnostic tool across mathematics.
How are eigenvalues used in data science and machine learning?
Eigenvalues play a central role in many data science techniques. Principal Component Analysis (PCA) uses eigenvalues of the covariance matrix to identify the most important directions of variance in data, enabling dimensionality reduction. The eigenvalues tell you how much variance each principal component explains. Spectral clustering uses eigenvalues of the graph Laplacian matrix to find natural groupings in data. Google PageRank algorithm is essentially finding the dominant eigenvector of the web link matrix. In recommendation systems, singular value decomposition (closely related to eigendecomposition) powers collaborative filtering algorithms used by Netflix and Amazon to suggest content.
What does it mean for a matrix to be diagonalizable?
A matrix is diagonalizable if it can be written as A = PDP^(-1), where D is a diagonal matrix of eigenvalues and P is a matrix whose columns are the corresponding eigenvectors. Not all matrices are diagonalizable. A sufficient condition is having n distinct eigenvalues for an n-by-n matrix. Symmetric matrices are always diagonalizable with orthogonal eigenvectors. When a matrix is diagonalizable, computing its powers becomes trivial: A^k = PD^kP^(-1), where D^k is just the diagonal entries raised to the kth power. This makes diagonalization extremely useful for solving systems of linear differential equations and computing matrix exponentials.
What is the spectral theorem and why does it matter?
The spectral theorem states that every real symmetric matrix (or more generally, every Hermitian matrix) can be decomposed as A = Q * Lambda * Q^T, where Q is an orthogonal matrix of eigenvectors and Lambda is a diagonal matrix of eigenvalues. This is a special case of diagonalization where the eigenvectors are guaranteed to be orthogonal and all eigenvalues are real. The spectral theorem matters because symmetric matrices arise naturally in optimization (Hessian matrices), physics (moment of inertia tensors), statistics (covariance matrices), and graph theory (Laplacian matrices). The guaranteed orthogonal decomposition provides numerically stable algorithms and geometrically meaningful interpretations.
How do eigenvalues determine the stability of dynamical systems?
For linear dynamical systems described by dx/dt = Ax, the eigenvalues of matrix A completely determine the stability behavior. If all eigenvalues have negative real parts, the system is asymptotically stable and all trajectories converge to the origin. If any eigenvalue has a positive real part, the system is unstable and solutions grow without bound. Purely imaginary eigenvalues produce oscillatory behavior without growth or decay. For discrete systems x(n+1) = Ax(n), stability requires all eigenvalues to have absolute value less than one. This eigenvalue stability analysis is fundamental in control theory, circuit design, structural engineering, and any field where system stability must be guaranteed.
References
Reviewed for accuracy by Manoj Kumar, Mathematics Educator · Editorial policy
Related Calculators
🧮Eigenvalue and Eigenvector Calculator
Calculate eigenvalue and eigenvector with inputs, formulas, and instant results.
🧮Annulus Area Calculator
Calculate annulus area with inputs, formulas, and instant results.
🧮Area Calculator
Calculate area with inputs, formulas, and instant results.
🧮Area of a Rectangle Calculator
Calculate the area, perimeter, and diagonal of a rectangle. Find missing sides from known area. Convert between metric and imperial area units.
🧮Area of Crescent Calculator
Calculate area of crescent with inputs, formulas, and instant results.
🧮Center of Mass Calculator
Calculate center of mass with inputs, formulas, and instant results.
🧮Centroid Calculator
Calculate centroid with inputs, formulas, and instant results.
🧮Chord Length Calculator
Calculate chord length with inputs, formulas, and instant results.