Numerical Analysis (G5147)

15 credits, Level 5

Spring teaching

We will set the rigorous theoretical foundations of the techniques that are used in modern algorithms of Scientific Computing. These include, for instance:

  • Numerical differentiation with order of approximation
  • Direct solvers for linear systems
  • LU, Cholesky, and QR factorisation
  • Banach fixed point theorem
  • Newton’s method.

The theory will help us understand how our calculators are correct when doing basic calculations, and how they can find the correct answers so fast.

We regularly review our modules to incorporate student feedback, staff expertise, as well as the latest research and teaching methodology. We鈥檙e planning to run these modules in the academic year 2026/27. However, there may be changes to these modules in response to feedback, staff availability, student demand or updates to our curriculum.

We鈥檒l make sure to let you know of any material changes to modules at the earliest opportunity.

Courses

This module is offered on the following courses: