| Section | Homework | |
|---|---|---|
| Part V: Eigenvalues | ||
| 25: Overview of Eigenvalue Algorithms | 25.1 and 25.3 | |
| 26: Reduction to Hessenberg or Tridiagonal Form | 26.1 | |
| 27: Rayleigh Quotient, Inverse Iteration | 27.1 and 27.4 | |
| 28: QR Algorithm without Shifts | 28.2 and 28.3 | |
| 29: QR Algorithm with Shifts | 29.1 | |
| 30: Other Eigenvalue Algorithms | 30.1 and 30.3 | |
| 31: Computing the SVD | 31.3 and 31.4 | |
| Part VI: Iterative methods | ||
| 32: Overview of iterative Methods | 32.1 and 32.2 | |
| 33: The Arnoldi Iteration | 33.1 and 33.2 | |
| 34: How Arnoldi Locates Eigenvalues | 34.1 and 34.2 | |
| 35: GMRES | 35.1 and 35.2 | |
| 36: The Lanczos Iteration | 36.1 and 36.3 | |
| 37: From Lanczos to Gauss Quadrature | 37.1 and 37.4 | |
| 38: Conjugate Gradients | 38.5 and 38.6 | |
| 39: Biorthogonolization Methods | 39.1 and 39.5 | |
| 40: Preconditioning | 40.1 and 40.2 | |