Numerical and Applied Analysis I
We turn to linear algebra and the structural properties of linear systems of equations relevant to their numerical solution. In this context we introduce eigenvalues and the spectral theory of matrices. Methods appropriate to the numerical solution of very large systems are discussed. We discuss modern techniques using randomized algorithms for fast matrix-vector multiplication, and fast direct solvers. Topics covered include the classical Fast Multipole Method, the interpolative decomposition, structured matrix algebra, randomized methods for low- rank approximation, and fast direct solvers for sparse matrices. These techniques are of central importance in applications of linear algebra to the numerical solution of PDE, and in Machine Learning. The theoretical content of this course is illustrated and supplemented throughout the year with substantial computational examples and assignments. 1 Course Unit
Sources
- Course catalogue โ2026โ2027