The singular values of any real matrix are the square roots of the eigenvalues of .
Say we want to find a that maximizes Where This is the same thing as maximizing , so we have
is always symmetric. After acknowledging that we can realizes that is a Constrained Optimization problem. being the constraint. We will simply use the largest eigenvalue of to find the largest value for . The location of this will simply be the corresponding normalized eigenvector.
The min value can be found using a similar method.
Calling singular values we can say that the is the max value of and is the min value.
Non-Negative Eigenvalues
The eigenvalues of are non-negative.
Proof
From the above Proof we can see, And hence,