Singular Value Decomposition
[18/100%]Following the derivation in the text, find an SVD for .
If are the nonzero singular values of , then it can be shown that the function defines a unitarily invariant norm (Exercise 5.6.9) for (or ) for each . Explain why the 2-norm and the Frobenius norm are the extreme cases in the sense that and .
Equation (5.12.4): .
Explain why (the and entries of the matrix-norm equivalence table from Exercise 5.1.8/5.12.3's own bound matrix).
Prove that if are the nonzero singular values of a rank matrix , and if , then .
(5.12.10): if are the nonzero singular values of , then for each , the distance from to the closest matrix of rank is . This clarifies the meaning of "sufficiently small" in the fact that small perturbations can't reduce rank.
Extend the result on the image of the unit sphere to include singular and rectangular matrices by showing that if are the nonzero singular values of , then the image of the unit 2-sphere is an ellipsoid (possibly degenerate) in which the th semiaxis is , where and are respective left-hand and right-hand singular vectors for .
Prove that if is the smallest nonzero singular value of , then
Extend the bound (where , for a nonsingular system's uncertainty analysis) to include singular and rectangular matrices by showing that if and are the respective minimum 2-norm solutions of consistent systems and , then
Can the same reasoning as in the nonsingular uncertainty example be used to argue that for , the upper and lower bounds are attainable for every ?
Prove that if for the smallest nonzero singular value of , then exists, and .
Consider a system in which , and suppose is subject to an uncertainty . Using -norms, determine the directions of and that give rise to the worst-case scenario .
An ill-conditioned matrix is suspected when a small pivot emerges during the LU factorization of (because is then large), but this is not an absolute test.
Construct an example of a matrix that is well conditioned but has a small pivot.
Construct an example of a matrix that is ill conditioned but has no small pivots.
Bound the relative uncertainty in the solution of a nonsingular system for which there is some uncertainty in but not in , by showing that if , where for any matrix norm with , then
If the 2-norm is used, insures .
Now bound the relative uncertainty in the solution of a nonsingular system for which there is some uncertainty in both and , by showing that if , where for any matrix norm with , then
If the 2-norm is used, insures . This exercise underscores the conclusion that if is well conditioned and the relative uncertainties in and are small, the relative uncertainty in must be small.
Consider the matrix .
Use the URV factorization computed in Exercise 5.11.8 to determine .
Now use the URV factorization obtained in Exercise 5.11.9 to determine . Do your results agree with those of part (a)?
For matrix in Exercise 5.11.8, and for , find the solution of that has minimum euclidean norm.
Equation (5.12.17): when is consistent, is the solution of minimal euclidean norm.
Suppose is a URV factorization (so it could be an SVD) of an matrix of rank , and suppose is partitioned as , where is . Prove that is the projector onto along .
In this case, is said to be an orthogonal projector because its range is orthogonal to its nullspace. What is the orthogonal projector onto along ?
Establish the following properties of .
when is nonsingular.
.
.
for all .
for all .
, and .
when and are orthogonal matrices, but in general (the reverse-order law fails).
and .
Explain why if and only if is an RPN matrix (i.e., ).
Let be such that .
Establish the Pythagorean theorem for matrices by proving .
Give an example to show that the result of part (a) does not hold for the matrix 2-norm.
Demonstrate that is the best approximate inverse for in the sense that is the matrix of smallest Frobenius norm that minimizes .