Masteries · Jason GlowneyArithmoí Book 1

Masteries

1.1.8 The Singular Value Decomposition

We now con­sid­er the sin­gu­lar value de­com­po­si­tion of a matrix to in­crease our con­cep­tu­al un­der­stand­ing of the geom­e­try in­volved in the linear trans­for­ma­tion process. All ma­tri­ces have a sin­gu­lar value de­com­po­si­tion, and the image of the unit sphere for any size, m×nm \times n, takes on the form of a hy­per­el­lipse. The hy­per­el­lipse can be de­fined ∈ℂm or ℝm\in \mathbb{C}^{m}\ or\ \mathbb{R}^{m}, to be the ob­tained sur­face that re­sults from stretch­ing the unit sphere ∈ℂm or ℝm\in \mathbb{C}^{m}\ or\ \mathbb{R}^{m}, by the scal­ing fac­tors σ1,σ2,…σm\sigma_{1},\sigma_{2},\ldots\sigma_{m}, in or­thog­o­nal di­rec­tions u1,u2,…umu_{1},u_{2},\ldots u_{m}. When taken to­geth­er, the set of vec­tors {σjuj}\{\sigma_{j}u_{j}\}, are the prin­ci­ple semi­ax­es of the hy­per­el­lipse, which are scaled by σ1,σ2,…σm\sigma_{1},\sigma_{2},\ldots\sigma_{m}, equat­ing to the length of these semi­ax­es. The rank of the matrix being con­sid­ered for the sin­gu­lar value de­com­po­si­tion de­ter­mines the number of non-zero scal­ing el­e­ments σj\sigma_{j} present in the de­com­po­si­tion. In what fol­lows, we use a sim­i­lar SVD de­f­i­n­i­tion to that de­scribed by Tre­fethen and Bau.1

The SVD is one of the more im­por­tant means to un­der­stand how a matrix will act on a math­e­mat­i­cal object like a vector or an­oth­er matrix. It also yields one of the most im­por­tant in­sights into the com­plex con­ju­gate trans­pose of a matrix (M†).\left( M^{\dagger} \right).The SVD de­com­po­si­tion for a matrix MM, is de­fined

M=UΣV†\begin{array}{r} M = U\Sigma V^{\dagger} \end{array}
(1.1.33)

for uni­tary

Unitary: V∈ℂn×n is unitary=(v1|v2|v3|…|vn),Unitary:\ V \in \mathbb{C}^{n \times n}\ is\ unitary = \left( v_{1}\left| v_{2} \right|v_{3}|\ldots|v_{n} \right),
Diagonal: Σ∈ℝm×n =(σ10000σ20000⋱0000σn).\begin{array}{r} Diagonal:\ \Sigma \in \mathbb{R}^{m \times n}\ = \begin{pmatrix} \sigma_{1} & 0 & 0 & 0 \\ 0 & \sigma_{2} & 0 & 0 \\ 0 & 0 & \ddots & 0 \\ 0 & 0 & 0 & \sigma_{n} \end{pmatrix}. \end{array}
(1.1.34)

We note that M†M^{\dagger}, or in some texts, M∗, MHM^{*},\ M^{\text{H}}, means the (com­plex) con­ju­gate trans­pose of the matrix M,M,and that the com­plex con­ju­gate trans­pose of a uni­tary matrix equals the in­verse of that matrix. For the matrix Σ\Sigma, we have di­ag­o­nal en­tries that are the real number scal­ing fac­tors σ1,σ2,…σm\sigma_{1},\sigma_{2},\ldots\sigma_{m}, arranged in de­scend­ing order along the di­ag­o­nal. The map­ping V†V^{\dagger}, will rotate or re­flect the sphere, while pre­serv­ing its shape, the matrix Σ\Sigma stretch­es the sphere by sin­gu­lar values σ1,σ2,…σm≠1,\sigma_{1},\sigma_{2},\ldots\sigma_{m} \neq 1,and the final matrix UU, will then rotate or re­flect the hy­per­el­lipse. Figure 1.1.2 graph­i­cal­ly de­picts the SVD of a matrix MM, for the ac­tions of V†V^{\dagger}, Σ\Sigma, and UU, which, when taken to­geth­er, ac­com­plish the linear trans­for­ma­tion MvMv.

Figure
Figure 1.1.2 – Sin­gu­lar Value De­com­po­si­tion UΣV†U\Sigma V^{\dagger} for the matrix M.
  1. Tre­fethen & Bau, "Nu­mer­i­cal Linear Al­ge­bra", 1997