- categories: Linear algebra, Factorization
Definition
Eigendecomposition is the process of decomposing a square matrix into a product of three matrices:
where:
- is a matrix whose columns are the eigenvectors of ,
- is a diagonal matrix with the eigenvalues of on the diagonal,
- is the inverse of .
Intuition
Eigendecomposition represents a transformation as a scaling operation in the directions defined by its eigenvectors. This decomposition allows the matrix to be expressed in terms of its most “natural” coordinate system.
Key Properties
-
Existence:
- Not all matrices can be eigendecomposed. must be diagonalizable, which occurs if has linearly independent eigenvectors (where is ).
- Symmetric Matrix is always diagonalizable.
-
Matrix Powers:
- If , then , simplifying computations of matrix powers.
-
Diagonalization:
- Eigendecomposition is equivalent to diagonalizing if possible.
-
Spectral Theorem:
- If is symmetric, then is orthogonal (), and the decomposition becomes .
Applications
-
PCA:
- Eigendecomposition of the covariance matrix identifies the principal components.
-
Dynamical Systems:
- Eigenvalues and eigenvectors describe system stability and modes of behavior.
-
Power Iteration and Matrix Approximations:
- Used in iterative algorithms to compute dominant eigenvalues and eigenvectors.
-
Quantum Mechanics:
- Decomposition of Hermitian operators represents physical observables.
-
Solving Differential Equations:
- Linear systems of differential equations are simplified via eigendecomposition.
Examples
- Given , find its eigendecomposition:
- Eigenvalues: , .
- Eigenvectors: , .
- , .
- .