7
10
9
2
5
2
0.707107
0.707107
0.447214
-0.894427
1
7
10
9
2
5
2
0.707107
0.707107
0.447214
-0.894427
1
The Eigenvector Calculator computes the eigenvectors of a 2×2 matrix, finding the special directions that are preserved by the linear transformation. An eigenvector $$v$$ of matrix $$A$$ satisfies $$Av = \lambda v$$ — the matrix multiplication simply scales the vector by the eigenvalue $$\lambda$$ without rotating it. Eigenvectors define the principal axes of the transformation and are fundamental to diagonalization, stability analysis, and countless applications in science and engineering.
To find eigenvectors, we first compute the eigenvalues from the characteristic polynomial, then solve the homogeneous system $$(A - \lambda I)v = 0$$ for each eigenvalue. For a 2×2 matrix with eigenvalue $$\lambda$$, this reduces to finding a non-zero vector in the null space of $$A - \lambda I$$. Since the matrix is singular (its determinant is zero by construction), the null space is always at least one-dimensional.
The eigenvectors of a 2×2 matrix reveal the geometric nature of the transformation. If both eigenvalues are positive, the transformation stretches along both eigenvector directions (a scaling). If one eigenvalue is negative, the transformation reflects along that direction. If the eigenvalues have different magnitudes, the transformation stretches more in one direction than the other, creating a shearing effect along the eigenvector axes.
Eigenvectors are essential for matrix diagonalization. If a 2×2 matrix has two linearly independent eigenvectors $$v_1$$ and $$v_2$$, the matrix can be written as $$A = PDP^{-1}$$ where $$P = [v_1 | v_2]$$ and $$D = \text{diag}(\lambda_1, \lambda_2)$$. This decomposition simplifies matrix powers ($$A^n = PD^nP^{-1}$$), matrix exponentials, and solving systems of differential equations.
In principal component analysis (PCA), the eigenvectors of the covariance matrix define the principal components — the directions of maximum variance in the data. In mechanical engineering, the eigenvectors of the stress tensor define the principal stress directions. In quantum mechanics, the eigenvectors of an observable operator define the possible measurement states.
This calculator computes normalized eigenvectors (unit length) for matrices with real eigenvalues. It displays both eigenvalues and their corresponding eigenvectors, and reports whether the matrix is diagonalizable. For complex eigenvalues, the eigenvectors would also be complex, and the calculator indicates this case. Understanding eigenvectors in the 2×2 setting provides the intuition needed for higher-dimensional eigenproblems.
For each eigenvalue $$\lambda_i$$, solve $$(A - \lambda_i I)v = 0$$:
$$\begin{pmatrix} a_{11} - \lambda & a_{12} \\ a_{21} & a_{22} - \lambda \end{pmatrix} \begin{pmatrix} v_x \\ v_y \end{pmatrix} = \begin{pmatrix} 0 \\ 0 \end{pmatrix}$$
From the first row: $$(a_{11} - \lambda)v_x + a_{12}v_y = 0$$
If $$a_{12} \neq 0$$: choose $$v = \begin{pmatrix} -a_{12} \\ a_{11} - \lambda \end{pmatrix}$$
If $$a_{12} = 0$$: the eigenvector depends on whether $$a_{11} - \lambda = 0$$
The eigenvectors are then normalized to unit length: $$\hat{v} = \frac{v}{\|v\|}$$
Each eigenvector represents a direction preserved by the matrix transformation. The corresponding eigenvalue gives the scaling factor along that direction. Normalized eigenvectors have unit length, making them easy to compare and use in decompositions. If the matrix is diagonalizable (two linearly independent eigenvectors), it can be expressed as $$A = PDP^{-1}$$. The eigenvectors form a basis in which the matrix acts as pure scaling. For complex eigenvalues, no real eigenvectors exist — the transformation is a rotation-scaling.
Inputs
Results
For λ₁=5: (A−5I)v=0 gives −v₁+v₂=0, so v₁∝(1,1), normalized to (1/√2, 1/√2). For λ₂=2: (A−2I)v=0 gives 2v₁+v₂=0, so v₂∝(1,−2), normalized to (1/√5, −2/√5).
Inputs
Results
A diagonal matrix is already in eigenvector form. λ₁ = 7 with eigenvector (0,1) and λ₂ = 3 with eigenvector (1,0) — the standard basis vectors.
Eigenvectors are unique only up to a scalar multiple. If $$v$$ is an eigenvector, so is $$cv$$ for any non-zero scalar $$c$$. This calculator returns normalized eigenvectors (unit length), which are unique up to sign. The eigenspace — the set of all eigenvectors for a given eigenvalue plus the zero vector — is a well-defined subspace.
A non-diagonalizable (defective) matrix does not have enough linearly independent eigenvectors to form a basis. For 2×2 matrices, this only happens when there is a repeated eigenvalue and the eigenspace is 1-dimensional. Such matrices can be put into Jordan normal form $$\begin{pmatrix} \lambda & 1 \\ 0 & \lambda \end{pmatrix}$$ instead. Complex eigenvalues make the matrix non-diagonalizable over $$\mathbb{R}$$ but diagonalizable over $$\mathbb{C}$$.
In Principal Component Analysis, you compute the eigenvectors of the data's covariance matrix. These eigenvectors (principal components) point in the directions of maximum variance. The first principal component captures the most variance, the second captures the most remaining variance orthogonal to the first, and so on. Projecting data onto the top eigenvectors reduces dimensionality while preserving maximum information.
For symmetric matrices ($$A = A^T$$), eigenvectors corresponding to different eigenvalues are always orthogonal. This is a special and very useful property called the Spectral Theorem. For non-symmetric matrices, eigenvectors are generally not orthogonal. The orthogonality of symmetric matrix eigenvectors is why PCA works so well — the covariance matrix is always symmetric.
When eigenvalues are complex ($$\alpha \pm \beta i$$), the eigenvectors are also complex. Over the reals, there are no eigenvectors — no direction is preserved by the transformation. The matrix acts as a rotation-scaling. However, over the complex numbers, two linearly independent eigenvectors exist. In applications, complex eigenvalues indicate oscillatory behavior in dynamical systems.
If $$Av = \lambda v$$, then $$A^n v = \lambda^n v$$. This means eigenvectors of $$A$$ are also eigenvectors of $$A^n$$ with eigenvalue $$\lambda^n$$. This property makes eigenvectors invaluable for computing matrix powers, solving linear recurrences (like the Fibonacci sequence), and analyzing the long-term behavior of Markov chains and dynamical systems.
Roboculator Team
The Roboculator Team explains calculations, planning tools, and practical formulas in clear language for real-life situations.
How helpful was this calculator?
Be the first to rate!
Matrix Addition Calculator
Linear Algebra Calculators
Matrix Multiplication Calculator
Linear Algebra Calculators
Matrix Determinant Calculator
Linear Algebra Calculators
Matrix Inverse Calculator
Linear Algebra Calculators
Matrix Transpose Calculator
Linear Algebra Calculators
Matrix Rank Calculator
Linear Algebra Calculators
