Section 5.12

Singular Value Decomposition

[18/100%]
Show
LaTeX
Problem 5.12.1

Following the derivation in the text, find an SVD for C=(−4−63−8)C = \begin{pmatrix} -4& -6 \\ 3& -8 \end{pmatrix}.

?
Problem 5.12.2

If σ1≥σ2≥⋯≥σr\sigma_{1}\geq \sigma_{2}\geq \cdots \geq \sigma_{r} are the nonzero singular values of AA, then it can be shown that the function νk(A)=(σ12+σ22+⋯+σk2)1/2\nu_{k}(A) = \left(\sigma_{1}^{2}+\sigma_{2}^{2}+\cdots +\sigma_{k}^{2}\right)^{1/2} defines a unitarily invariant norm (Exercise 5.6.9) for Rm×n\mathbb {R}^{m\times n} (or Cm×n\mathbb {C}^{m\times n}) for each k=1,2,…,rk=1,2,\ldots ,r. Explain why the 2-norm and the Frobenius norm are the extreme cases in the sense that ∥A∥22=σ12\left\| A\right\|_{2}^{2} = \sigma_{1}^{2} and ∥A∥F2=σ12+σ22+⋯+σr2\left\| A\right\|_{F}^{2} = \sigma_{1}^{2}+\sigma_{2}^{2}+\cdots +\sigma_{r}^{2}.

?
Remark.
?

Equation (5.12.4): σ1=max⁡∥x∥2=1∥Ax∥2=∥A∥2\sigma_{1} = \max_{\left\| x\right\|_{2}=1}\left\| Ax\right\|_{2} = \left\| A\right\|_{2}.

Problem 5.12.3

Explain why ∥A∥2≤∥A∥F≤n∥A∥2\left\| A\right\|_{2} \leq \left\| A\right\|_{F} \leq \sqrt{n}\left\| A\right\|_{2} (the (2,F)(2,F) and (F,2)(F,2) entries of the matrix-norm equivalence table from Exercise 5.1.8/5.12.3's own bound matrix).

?
Problem 5.12.4

Prove that if σ1≥σ2≥⋯≥σr\sigma_{1}\geq \sigma_{2}\geq \cdots \geq \sigma_{r} are the nonzero singular values of a rank rr matrix AA, and if ∥E∥2<σr\left\| E\right\|_{2} < \sigma_{r}, then rk⁡(A+E)≥rk⁡(A)\operatorname {rk}\left(A+E\right) \geq \operatorname {rk}\left(A\right).

?
Remark.
?

(5.12.10): if σ1≥⋯≥σr\sigma_{1}\geq \cdots \geq \sigma_{r} are the nonzero singular values of Am×nA_{m\times n}, then for each k<rk<r, the distance from AA to the closest matrix of rank kk is σk+1=min⁡rk⁡(B)=k∥A−B∥2\sigma_{k+1} = \min_{\operatorname {rk}\left(B\right)=k}\left\| A-B\right\|_{2}. This clarifies the meaning of "sufficiently small" in the fact that small perturbations can't reduce rank.

Problem 5.12.5

Extend the result on the image of the unit sphere to include singular and rectangular matrices by showing that if σ1≥σ2≥⋯≥σr>0\sigma_{1}\geq \sigma_{2}\geq \cdots \geq \sigma_{r}>0 are the nonzero singular values of Am×nA_{m\times n}, then the image A(S2)⊂RmA(S_{2}) \subset \mathbb {R}^{m} of the unit 2-sphere S2⊂RnS_{2}\subset \mathbb {R}^{n} is an ellipsoid (possibly degenerate) in which the kkth semiaxis is σkU∗k=AV∗k\sigma_{k}U_{*k} = AV_{*k}, where U∗kU_{*k} and V∗kV_{*k} are respective left-hand and right-hand singular vectors for AA.

?
Problem 5.12.6

Prove that if σr\sigma_{r} is the smallest nonzero singular value of Am×nA_{m\times n}, then

σr=min⁡∥x∥2=1x∈R(AT)∥Ax∥2=1/∥A†∥2. \sigma _{r} = \min _{\substack {\left\| x\right\| _{2}=1 \\ x \in \mathcal{R}(A^{T})}} \left\| Ax\right\| _{2} = 1/\left\| A^{\dagger }\right\| _{2}.
?
Problem 5.12.7

Extend the bound κ−1∥e∥/∥b∥≤∥x−x~∥/∥x∥≤κ∥e∥/∥b∥\kappa^{-1}\left\| e\right\| /\left\| b\right\| \leq \left\| x-\tilde{x}\right\| /\left\| x\right\| \leq \kappa \left\| e\right\| /\left\| b\right\| (where κ=∥A∥∥A−1∥\kappa = \left\| A\right\| \left\| A^{-1}\right\|, for a nonsingular system's uncertainty analysis) to include singular and rectangular matrices by showing that if xx and x~\tilde{x} are the respective minimum 2-norm solutions of consistent systems Ax=bAx=b and Ax~=b~=b−eA\tilde{x} = \tilde{b} = b-e, then

κ−1∥e∥∥b∥≤∥x−x~∥∥x∥≤κ∥e∥∥b∥,where κ=∥A∥∥A†∥. \kappa ^{-1}\frac{\left\| e\right\| }{\left\| b\right\| } \leq \frac{\left\| x-\tilde{x}\right\| }{\left\| x\right\| } \leq \kappa \frac{\left\| e\right\| }{\left\| b\right\| }, \qquad \text{where } \kappa = \left\| A\right\| \left\| A^{\dagger }\right\| .

Can the same reasoning as in the nonsingular uncertainty example be used to argue that for ∥⋆∥2\left\| \star \right\|_{2}, the upper and lower bounds are attainable for every AA?

?
Problem 5.12.8

Prove that if ∣ϵ∣<σr2\left|\epsilon \right| < \sigma_{r}^{2} for the smallest nonzero singular value of Am×nA_{m\times n}, then (ATA+ϵI)−1(A^{T}A+\epsilon I)^{-1} exists, and lim⁡ϵ→0(ATA+ϵI)−1AT=A†\lim_{\epsilon \to 0}(A^{T}A+\epsilon I)^{-1}A^{T} = A^{\dagger }.

?
Problem 5.12.9

Consider a system Ax=bAx=b in which A=(.835.667.333.266)A = \begin{pmatrix} .835& .667 \\ .333& .266 \end{pmatrix}, and suppose bb is subject to an uncertainty ee. Using ∞\infty-norms, determine the directions of bb and ee that give rise to the worst-case scenario ∥x−x~∥∞/∥x∥∞=κ∞∥e∥∞/∥b∥∞\left\| x-\tilde{x}\right\|_{\infty }/\left\| x\right\|_{\infty } = \kappa_{\infty }\left\| e\right\|_{\infty }/\left\| b\right\|_{\infty }.

?
Problem 5.12.10

An ill-conditioned matrix is suspected when a small pivot uiiu_{ii} emerges during the LU factorization of AA (because [U−1]ii=1/uii\left[U^{-1}\right]_{ii} = 1/u_{ii} is then large), but this is not an absolute test.

?
(a)

Construct an example of a matrix that is well conditioned but has a small pivot.

(b)

Construct an example of a matrix that is ill conditioned but has no small pivots.

Problem 5.12.11

Bound the relative uncertainty in the solution of a nonsingular system Ax=bAx=b for which there is some uncertainty in AA but not in bb, by showing that if (A−E)x~=b(A-E)\tilde{x}=b, where α=∥A−1E∥<1\alpha = \left\| A^{-1}E\right\| < 1 for any matrix norm with ∥I∥=1\left\| I\right\| =1, then

∥x−x~∥∥x∥≤κ1−α∥E∥∥A∥,where κ=∥A∥∥A−1∥. \frac{\left\| x-\tilde{x}\right\| }{\left\| x\right\| } \leq \frac{\kappa }{1-\alpha }\frac{\left\| E\right\| }{\left\| A\right\| }, \qquad \text{where } \kappa = \left\| A\right\| \left\| A^{-1}\right\| .
?
Remark.
?

If the 2-norm is used, ∥E∥2<σn\left\| E\right\|_{2}<\sigma_{n} insures α<1\alpha <1.

Problem 5.12.12

Now bound the relative uncertainty in the solution of a nonsingular system Ax=bAx=b for which there is some uncertainty in both AA and bb, by showing that if (A−E)x~=b−e(A-E)\tilde{x} = b-e, where α=∥A−1E∥<1\alpha = \left\| A^{-1}E\right\| < 1 for any matrix norm with ∥I∥=1\left\| I\right\| =1, then

∥x−x~∥∥x∥≤κ1−κ∥E∥/∥A∥(∥e∥∥b∥+∥E∥∥A∥),where κ=∥A∥∥A−1∥. \frac{\left\| x-\tilde{x}\right\| }{\left\| x\right\| } \leq \frac{\kappa }{1-\kappa \left\| E\right\| /\left\| A\right\| }\left(\frac{\left\| e\right\| }{\left\| b\right\| } + \frac{\left\| E\right\| }{\left\| A\right\| }\right), \qquad \text{where } \kappa = \left\| A\right\| \left\| A^{-1}\right\| .
?
Remark.
?

If the 2-norm is used, ∥E∥2<σn\left\| E\right\|_{2}<\sigma_{n} insures α<1\alpha <1. This exercise underscores the conclusion that if AA is well conditioned and the relative uncertainties in AA and bb are small, the relative uncertainty in xx must be small.

Problem 5.12.13

Consider the matrix A=(−4−2−4−22−221−41−4−2)A = \begin{pmatrix} -4& -2& -4& -2 \\ 2& -2& 2& 1 \\ -4& 1& -4& -2 \end{pmatrix}.

?
(a)

Use the URV factorization computed in Exercise 5.11.8 to determine A†A^{\dagger }.

(b)

Now use the URV factorization obtained in Exercise 5.11.9 to determine A†A^{\dagger }. Do your results agree with those of part (a)?

Problem 5.12.14

For matrix AA in Exercise 5.11.8, and for b=(−123−9)Tb = \begin{pmatrix} -12& 3& -9 \end{pmatrix}^{T}, find the solution of Ax=bAx=b that has minimum euclidean norm.

?
Remark.
?

Equation (5.12.17): when Ax=bAx=b is consistent, x=A†bx = A^{\dagger }b is the solution of minimal euclidean norm.

Problem 5.12.15

Suppose A=URVTA = URV^{T} is a URV factorization (so it could be an SVD) of an m×nm\times n matrix of rank rr, and suppose UU is partitioned as U=[U1∣U2]U = \left[U_{1}\mid U_{2}\right], where U1U_{1} is m×rm\times r. Prove that P=U1U1T=AA†P = U_{1}U_{1}^{T} = AA^{\dagger } is the projector onto R(A)\mathcal{R}(A) along N(AT)\mathcal{N}(A^{T}).

?
Remark.
?

In this case, PP is said to be an orthogonal projector because its range is orthogonal to its nullspace. What is the orthogonal projector onto N(AT)\mathcal{N}(A^{T}) along R(A)\mathcal{R}(A)?

Problem 5.12.16

Establish the following properties of A†A^{\dagger }.

?
(a)

A†=A−1A^{\dagger } = A^{-1} when AA is nonsingular.

(b)

(A†)†=A(A^{\dagger })^{\dagger } = A.

(c)

(A†)T=(AT)†(A^{\dagger })^{T} = (A^{T})^{\dagger }.

(d)

A†={(ATA)−1ATwhen rk⁡(Am×n)=n,AT(AAT)−1when rk⁡(Am×n)=m.A^{\dagger } = \begin{cases} (A^{T}A)^{-1}A^{T} & \text{when } \operatorname {rk}\left(A_{m\times n}\right)=n, \\ A^{T}(AA^{T})^{-1} & \text{when } \operatorname {rk}\left(A_{m\times n}\right)=m. \end{cases}

(e)

AT=ATAA†=A†AATA^{T} = A^{T}AA^{\dagger } = A^{\dagger }AA^{T} for all A∈Rm×nA \in \mathbb {R}^{m\times n}.

(f)

A†=AT(AAT)†=(ATA)†ATA^{\dagger } = A^{T}(AA^{T})^{\dagger } = (A^{T}A)^{\dagger }A^{T} for all A∈Rm×nA \in \mathbb {R}^{m\times n}.

(g)

R(A†)=R(AT)=R(A†A)\mathcal{R}(A^{\dagger }) = \mathcal{R}(A^{T}) = \mathcal{R}(A^{\dagger }A), and N(A†)=N(AT)=N(AA†)\mathcal{N}(A^{\dagger }) = \mathcal{N}(A^{T}) = \mathcal{N}(AA^{\dagger }).

(h)

(PAQ)†=QTA†PT(PAQ)^{\dagger } = Q^{T}A^{\dagger }P^{T} when PP and QQ are orthogonal matrices, but in general (AB)†≠B†A†(AB)^{\dagger } \neq B^{\dagger }A^{\dagger } (the reverse-order law fails).

(i)

(ATA)†=A†(AT)†(A^{T}A)^{\dagger } = A^{\dagger }(A^{T})^{\dagger } and (AAT)†=(AT)†A†(AA^{T})^{\dagger } = (A^{T})^{\dagger }A^{\dagger }.

Problem 5.12.17

Explain why A†=ADA^{\dagger } = A^{D} if and only if AA is an RPN matrix (i.e., R(A)⊥N(A)\mathcal{R}(A)\perp \mathcal{N}(A)).

?
Problem 5.12.18

Let X,Y∈Rm×nX, Y \in \mathbb {R}^{m\times n} be such that R(X)⊥R(Y)\mathcal{R}(X) \perp \mathcal{R}(Y).

?
(a)

Establish the Pythagorean theorem for matrices by proving ∥X+Y∥F2=∥X∥F2+∥Y∥F2\left\| X+Y\right\|_{F}^{2} = \left\| X\right\|_{F}^{2} + \left\| Y\right\|_{F}^{2}.

(b)

Give an example to show that the result of part (a) does not hold for the matrix 2-norm.

(c)

Demonstrate that A†A^{\dagger } is the best approximate inverse for AA in the sense that A†A^{\dagger } is the matrix of smallest Frobenius norm that minimizes ∥I−AX∥F\left\| I-AX\right\|_{F}.