Every result in Stage 3 so far required a square matrix — makes no sense unless and live in the same space. But most matrices built from real data are not square: a returns matrix has many more trading days (rows) than assets (columns); a factor-loading matrix has more instruments than factors. This closing topic of the unit previews the decomposition that removes the square restriction entirely — the singular value decomposition , which exists for every matrix, square or not, defective or not. It is deliberately a preview only: the full construction, the proof of existence, and the deep consequences (low-rank approximation, the pseudoinverse, numerical stability) are the central subject of
learn/library/mathematics/linear-algebra-ii/.By the end of this topic you should be able to:
- state what the SVD is and why it generalises diagonalisation to any matrix;
- explain, geometrically, what the singular values and singular vectors represent;
- connect the SVD to the eigenvalues of ;
- describe, at a first-look level, how PCA is the SVD applied to a mean-centred data matrix.
In this lesson
- Contents
- The big picture
The full lesson is for members.
Read the full lessonNew to SelfMadeQuant.com? See membership options or browse the Linear Algebra, Optimisation and Numerical Methods syllabus.