Eigen Value Decomposition
Solution of the below equation gives the eigenvalues and eigenvectors.
Eigenvectors are basically the vectors which only scale under the transformation where the scale is given by .
Let be matrix of dimension . And let it have all the real eigenvalues and eigenvectors i.e eigenvalues and eigenvectors. Then we will following equations.
Basically we get equations with being eigenvectors, now we should we able to represent all the individual equations using one matrix equation. You can see that all the equations can be combined as
where is essentially a matrix with vector as its columns.
Let's represent as i.e . Then we can write
Where is the matrix made by eigenvectors as columns of and is the diagonal matrix with eigenvalues as diagonal elements.
This is eigenvalue decomposition.
Real-Symmetric Matrix
Now if the matrix is real-symmetric matrix, the eigenvectors are actually orthogonal. Then we represent the decomposition as
Where is 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 is real-symmetrix then solution of subject to . Here is is an eigenvector then is corresponding eigenvalue. The minimum and maximum value of is simply minimum and maximum eigenvalue.
If all eigenvalues are positive then the matrix is positive-definite. Similary about positive-semidefinite, etc.
Last updated