|
⇤ ← Revision 1 as of 2026-02-07 01:52:26
Size: 1576
Comment: Initial commit
|
Size: 1706
Comment: Alternative solution
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 27: | Line 27: |
| With '''''V''''' and '''''Σ''''' known, '''''U''''' can be solved for. | With '''''V''''' and '''''Σ''''' known, '''''U''''' can be solved for. Alternatively, repeat the above method on '''''AA'''^T^''. '''''U''''' will be that eigenbasis. The eigenvalues will be the same. |
Singular Value Decomposition
The singular value decomposition (SVD) is a decomposition that follows from the definition of singular values.
Description
Any linear transformation can be rewritten as a rotation (i.e., from the original basis onto a convenient basis), a scaling and stretching, and another rotation (i.e., from the convenient basis onto the destination basis). Therefore A = UΣVT.
Solution
The definition of singular values (AV = UΣ) can be restated as A = UΣV-1. If the certain vectors vi are chosen to be orthogonal bases of the row space, then it is also true that A = UΣVT.
Note then that ATA = (UΣVT)TUΣVT = VΣTUTUΣVT = VΣTΣVT. Because Σ is a diagonal matrix with values of σ on the diagonal, ΣTΣ evaluates to a diagonal matrix with values of σ2 on the diagonal.
Effectively, this is a diagonalization of ATA. V is the eigenbasis. Λ is equal to ΣTΣ, therefore λ = σ2.
With V and Σ known, U can be solved for. Alternatively, repeat the above method on AAT. U will be that eigenbasis. The eigenvalues will be the same.
