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

  1. Existence:

    • Not all matrices can be eigendecomposed. must be diagonalizable, which occurs if has linearly independent eigenvectors (where is ).
    • Symmetric Matrix is always diagonalizable.
  2. Matrix Powers:

    • If , then , simplifying computations of matrix powers.
  3. Diagonalization:

    • Eigendecomposition is equivalent to diagonalizing if possible.
  4. Spectral Theorem:

    • If is symmetric, then is orthogonal (), and the decomposition becomes .

Applications

  1. PCA:

    • Eigendecomposition of the covariance matrix identifies the principal components.
  2. Dynamical Systems:

    • Eigenvalues and eigenvectors describe system stability and modes of behavior.
  3. Power Iteration and Matrix Approximations:

    • Used in iterative algorithms to compute dominant eigenvalues and eigenvectors.
  4. Quantum Mechanics:

    • Decomposition of Hermitian operators represents physical observables.
  5. Solving Differential Equations:

    • Linear systems of differential equations are simplified via eigendecomposition.

Examples

  1. Given , find its eigendecomposition:
    • Eigenvalues: , .
    • Eigenvectors: , .
    • , .
    • .