Search⌘ K
AI Features

Eigendecomposition of a Matrix

Explore matrix eigendecomposition to factorize matrices into eigenvalues and eigenvectors using R and Rcpp. Understand how to verify decompositions and find dominant eigenvalues with power iteration algorithms, leveraging libraries like Armadillo and Eigen for efficient computation.

Eigendecomposition, also called spectral decomposition, is the factorization of a matrix into a canonical form, where the matrix 𝐴𝐴 is represented in terms of its eigenvalues and eigenvectors.

A=QΞ›Qβˆ’1A = Q \Lambda Q^{-1}

  • The matrix 𝑄𝑄 is a 𝑛×𝑛𝑛 Γ— 𝑛 square matrix where the ithith column is the eigenvector π‘žπ‘–π‘ž_𝑖 of 𝐴𝐴.
  • The matrix Ξ›\Lambda is the diagonal matrix where the diagonal elements are the corresponding eigenvalues Ξ›ii=Ξ»i\Lambda_{ii} = \lambda_i.

Only diagonalizable matrices can be factorized in this way.

A (nonzero) vector 𝑣𝑣 of dimension n is an eigenvector of a square 𝑛×𝑛𝑛 \times 𝑛 matrix 𝐴𝐴 if it satisfies the linear equation:

...