Module and Programme Catalogue

Search site

Find information on

2020/21 Undergraduate Module Catalogue

MATH2600 Numerical Analysis

10 creditsClass Size: 120

Module manager: Dr Evy Kersale

Taught: Semester 2 (Jan to Jun) View Timetable

Year running 2020/21

Pre-requisite qualifications

MATH1005 or MATH1010 or (MATH1050 and MATH1060) or (MATH1050 and MATH1331), or equivalent.

This module is mutually exclusive with

MATH2601Numerical Analysis with Computation

This module is approved as a discovery module

Module summary

Most of the problems that students meet when they are introduced to, for example, integration or differential equations, will have nice analytic solutions. In real life though this is typically not the case and so solutions have to be evaluated numerically (ie with the aid of a computer). This module explains how to express mathematical operations in terms of operations that can be performed on a computer. It is a good preparation for modules in Numerical Methods.


On completion of this module, students should be able to:
- describe how errors arise in computations
- solve simple non-linear equations by root-finding techniques
- calculate the interpolating polynomial through discrete data points
- derive and use quadrature formulae based on integration of polynomial interpolates
- write down suitable numerical schemes for solving first order ordinary differential equations
- solve linear systems of algebraic equations using Gaussian elimination and LU factorisation.


1. Introduction. Computer arithmetic. Errors; round-off error, truncation error.
2. Solution of nonlinear equations in one variable. Bisection method; fixed point iteration; Newton-Raphson iteration; secant method. Order of convergence.
3. Interpolation. Lagrange interpolation; error term. cubic splines.
4. Numerical integration. Trapezoidal rule. Method of undetermined coefficients. Simpson's rule. Newton-Cotes formulae. Composite integration methods. Richardson extrapolation; Romberg integration.
5. Ordinary differential equations (initial value problems). Euler's method; errors. Runge-Kutta methods. Multi-step methods. Stability.
6. Linear systems of algebraic equations. Gaussian elimination. Pivoting. LU factorisation.

Teaching methods

Due to COVID-19, teaching and assessment activities are being kept under review - see module enrolment pages for information

Delivery typeNumberLength hoursStudent hours
Private study hours68.00
Total Contact hours32.00
Total hours (100hr per 10 credits)100.00

Private study

Studying and revising of course material.
Completing of assignments and assessments.

Opportunities for Formative Feedback

Regular problem solving assignments

Methods of assessment

Due to COVID-19, teaching and assessment activities are being kept under review - see module enrolment pages for information

Assessment typeNotes% of formal assessment
In-course Assessment.15.00
Total percentage (Assessment Coursework)15.00

There is no resit available for the coursework component of this module. If the module is failed, the coursework mark will be carried forward and added to the resit exam mark with the same weighting as listed above.

Exam typeExam duration% of formal assessment
Standard exam (closed essays, MCQs etc)2 hr 00 mins85.00
Total percentage (Assessment Exams)85.00

Normally resits will be assessed by the same methodology as the first attempt, unless otherwise stated

Reading list

The reading list is available from the Library website

Last updated: 10/08/2020 08:42:06


Browse Other Catalogues

Errors, omissions, failed links etc should be notified to the Catalogue Team.PROD

© Copyright Leeds 2019