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.


100%: Lecture


20%: Coursework (Portfolio, Problem set)
80%: Examination (Unseen examination)

Contact hours and workload

This module is approximately 150 hours of work. This breaks down into about 33 hours of contact time and about 117 hours of independent study. The University may make minor variations to the contact hours for operational reasons, including timetabling requirements.

We regularly review our modules to incorporate student feedback, staff expertise, as well as the latest research and teaching methodology. We’re planning to run these modules in the academic year 2024/25. However, there may be changes to these modules in response to feedback, staff availability, student demand or updates to our curriculum. We’ll make sure to let you know of any material changes to modules at the earliest opportunity.


This module is offered on the following courses: