Course - Numerical Analysis HT24
Introduces some topics in numerical analysis, which is roughly the study of finding approximate solutions to continuous problems in mathematics. Topics include: solving systems of linear equations, calculating eigenvalues, approximating functions with polynomials, and computing solutions to ODEs.
Why do you need approximate solutions rather than exact ones? There are many reasons, but one particular example comes up in Notes - Numerical Analysis HT24, EigenvaluesU. Computing the eigenvalues of a matrix reduces to finding the roots of the characteristic polynomial. Because of the Abel-Ruffini theorem, there is no way of writing down these roots in simple terms and so you have to use approximate methods to find them.
- Course Webpage
- Lecture Notes
- Lecture 1, Lagrange Interpolation
- Lecture 2, Gaussian Elimination and LU Factorisation
- Lecture 3, QR Factorisation
- Lecture 4, Least-squares problem
- Lecture 5, SVD
- Lecture 6, Matrix eigenvalues
- Lecture 7, Computing eigenvalues
- Lecture 8, Computing eigenvalues
- Lecture 9, Best approximation in Inner-product spaces
- Lecture 10, Orthogonal polynomials
- Lecture 11, Gauss quadrature
- Lecture 12, Initial value problems
- Lecture 13, Initial value problems
- Lecture 14, Runge-Kutte methods
- Lecture 15, Multistep methods
- Lecture 16, Multistep methods
- My notes here are based on the lecture notes and slides above, written by the course lecturer Prof. Yuji Nakatsukasa.
- Overlaps with: Course - Machine Learning MT23U
- Other courses this term: Courses HT24U
Notes
Notes - Numerical Analysis HT24, Singular value decompositionU
Notes - Numerical Analysis HT24, Best approximation in inner product spacesU
