Linear algebra
Matrices as maps: rank, projections, eigenvectors and matrix factorizations.
3 lessons open · 15 planned
Pages you can open
Planned
In learning order. These are not pages yet.
- Column space, null space, and rankIntro
- Dot product and orthogonal projectionIntro
- Eigenvectors: the directions a matrix only stretchesIntro
- Solving Ax = b: one, none, or infinitely many solutionsIntro
- Projection onto a subspace and least squaresIntro
- Diagonalization and what happens when you apply A again and againIntro
- Why symmetric matrices have an orthogonal basis of eigenvectorsIntro
- Gram-Schmidt and the QR decompositionIntro
- Quadratic forms: bowls, saddles, and level ellipsesIntro
- Singular value decomposition: rotate, stretch, rotateIntro
- Gaussian elimination is LU factorizationIntro
- What a covariance matrix does to a circleAdvanced undergrad
- The matrix exponential e^(At)Advanced undergrad
- Positive semidefinite matrices: why a correlation matrix can be invalidAdvanced undergrad
- Cholesky decomposition: turning independent noise into correlated noiseAdvanced undergrad
How it connects
Builds on Probability Differential equations
Leads to Geometry Stochastic processes Optimization Numerical methods Probability Computational statistics Bonds and interest rates Arbitrage and risk-neutral pricing Calculus Differential equations Regression Equities and portfolios
Subjects marked “connection” are linked by a related idea, not by a prerequisite.