Eigen Value Decomposition
Solution of the below equation gives the eigenvalues and eigenvectors.
Eigenvectors are basically the vectors which only scale under the transformation Awhere the scale is given by λ.
Let Abe matrix of dimension n×n. And let it have all the real eigenvalues and eigenvectors i.e neigenvalues and eigenvectors. Then we will following equations.
Basically we get n equations with xi​being eigenvectors, now we should we able to represent all the nindividual equations using one matrix equation. You can see that all the equations can be combined as
where [x1​,x2​,...,xn​]is essentially a matrix with vector x1​,x2​,...,xn​as its columns.
Let's represent [x1​,x2​,...,xn​]as Vi.e V=[x1​,x2​,...,xn​]. Then we can write
Where Vis the matrix made by eigenvectors as columns of Vand diag(λ1​,λ2​,...,λn​)is the diagonal matrix with eigenvalues as diagonal elements.
This is eigenvalue decomposition.
Real-Symmetric Matrix
Now if the matrix Ais real-symmetric matrix, the eigenvectors are actually orthogonal. Then we represent the decomposition as
Where Qis an orthogonal matrix formed by orthogonal eigenvectors.
Use of Eigenvalues
Matrix is singular if and only if any of it's eigenvalues are zero.
If Ais real-symmetrix then solution of f(x)=xTAx subject to ∣∣x∣∣2​=1. Here is xis an eigenvector then f(x)is corresponding eigenvalue. The minimum and maximum value of f(x)is simply minimum and maximum eigenvalue.
If all eigenvalues are positive then the matrix is positive-definite. Similary about positive-semidefinite, etc.
A2=AA=XΛX−1XΛX−1=XΛ2X−1
Last updated