This course is about the key numerical algorithms that you should really want to know about. How do GPS and TrueType fonts work? How to move a robot around? What is the secret of Google's success? Why is JPEG compression so efficient? The answers to these questions are clever numerical algorithms, based on least squares, Bézier curves, quadrature, eigenvalues, and the discrete cosine transformation, respectively. We will be able to understand and discuss them once we have gone through some preliminary basics, including Newton's method for finding roots, direct and iterative methods for solving linear systems of equations, and polynomial interpolation. This course refreshes your basic math skills in calculus and linear algebra and shows how to utilize them for solving several real-world problems, like the ones mentioned earlier. We also provide references to the history of these solutions, going back to Newton, Leibniz, Euler, Gauss, and others.
- Numerical Analysis; Sauer; Pearson, 2012
- Additional material will be provided through the course homepage.
Master of Science in Computational Science, Core course, Lecture, 1st year
Master of Science in Informatics, Elective course, Lecture, 2nd year
Master of Science in Informatics, Elective course, Lecture, 1st year
PhD programme of the Faculty of Informatics, Elective course, Lecture, 2nd year (4 ECTS)
PhD programme of the Faculty of Informatics, Elective course, Lecture, 1st year (4 ECTS)