Table of contents
6 chapters · 25 sections
Foundations
- 1.1Vector and matrix norms
- 1.2Floating-point arithmetic
- 1.3Conditioning and stability
- 1.4Backward error analysis
Direct Methods
- 2.1Gaussian elimination and pivoting
- 2.2LU factorisation
- 2.3Cholesky factorisation
- 2.4Banded and sparse matrices
Orthogonal Factorisations
- 3.1Householder reflections
- 3.2Givens rotations
- 3.3QR factorisation
- 3.4Least-squares problems
Singular Value Decomposition
- 4.1Existence and geometry of the SVD
- 4.2Low-rank approximation (Eckart–Young)
- 4.3Pseudo-inverse
- 4.4Applications: compression and PCA
Eigenvalue Problems
- 5.1Power and inverse iteration
- 5.2Rayleigh quotient iteration
- 5.3The QR algorithm
- 5.4Symmetric eigenproblems
Iterative Methods
- 6.1Jacobi and Gauss–Seidel
- 6.2SOR
- 6.3Conjugate gradient
- 6.4Krylov subspaces and GMRES
- 6.5Preconditioning