As we will be dealing with square matrices, we choose the example for a matrix , to be
(1.1.36)
We start by computing
(1.1.37)
then calculate the matrix product
(1.1.38)
To determine our singular value matrix , we find the eigenvalues of , take their square roots, and arrange them in descending order
(1.1.39)
and determine the inverse of , equals
(1.1.40)
To determine the matrix, we solve for each eigenvalue of , in order to find the values of the columns of , ensuring these are normalized. For the first eigenvalue we have
(1.1.41)
A similar calculation for the second eigenvalue , results in
(1.1.43)
where the matrix is then
(1.1.44)
Taking the SVD decomposition
we solve the SVD for , to find
(1.1.45)
which for the case example, we find equals
(1.1.46)
and the SVD of the matrix , is
(1.1.47)
To finish, we look at how the SVD decomposition of acts on the vector . Starting with the product
(1.1.48)
we note that the two-norm of the starting and resultant vectors is , meaning in polar coordinates, the starting vector has the same radial distance (modulus) from the origin as the resulting vector . The transformation performed by the matrix on , is a rotation that maps both components of the vector into the real field. Scaling by , we find
(1.1.49)
noting that our first vector element , equaling , and our second vector element , to now equal to . The last step is to multiply the above result by the matrix , finding
(1.1.50)
where the rotation gives us the real and imaginary vector elements once again.