2021/22 Undergraduate Module Catalogue
MATH3476 Numerical Methods
15 creditsClass Size: 100
Module manager: Adrian Barker
Taught: Semester 1 (Sep to Jan) View Timetable
Year running 2021/22
|MATH2601||Numerical Analysis with Computation|
This module is not approved as a discovery module
Module summaryOrdinary and partial differential equations (ODEs and PDEs) are ubiquitous in the modelling of real problems arising in science, engineering and economics. However, only rarely can ODEs and PDEs be solved exactly in mathematical terms, and so approximate methods of solution are of paramount importance.The basic idea employed in this course is that of discretizing the original continuous problem to obtain a discrete problem, or system of equations, that may be solved with the aid of a computer.This course introduces the basic ideas underlying approximation and its application, via finite differences, to the solution of ODEs and PDEs. As part of the approximation process, numerical linear algebraic techniques are developed in order to provide calculable solutions to the discrete equations.
On completion of this module, students should be able to:
- work independently to acquire an understanding of the relevant background theory;
- work collaboratively to apply theory in solving problems;
- interpolate periodic and non-periodic data on a finite 1-D interval using minimax, Chebyshev and forced-oscillation approximation techniques;
- understand the Runge phenomenon; understand spectral accuracy; approximate partial derivatives by differences in both 1-and 2-D to prespecified orders and accuracy using both series and operator methods;
- set up linear systems of simultaneous algebraic equations to solve 1- and 2-D elliptic BVPs; and
- solve such equations by a variety of direct and iterative methods; understand the theory underlying such methods.
Approximation Theory - Lagrange interpolation; Newton divided differences; interpolation errors; Weierstrass' theorem; minimax approximations; Chebyshev equioscillation and de la Vallee-Poussin theorems; Chebyshev polynomials; least-squares, near-minimax, interpolation; forced-oscillation approximations; spectrally accurate evaluation of Fourier co-efficients.
Numerical Differentiation - 1-D finite differences of arbitrary order and accuracy; FD operators; implicit FD formulae; regular and irregular meshes; molecules and stencils; 2-D FD formulae; first- and higher-order approximations to Laplacian; Poisson equation and Mehrstellenverfahren; high-order multidimensional derivatives.
Numerical Linear Algebra - matrix and vector norms; spectral radius; diagonal dominance; Gerschgorin's and Bauer's theorems; sparse systems; tridiagonal systems and Cholesky factorisation; Jacobi, Gauss-siedel and SOR iteration; theoretical convergence estimates; optimum over-relaxation; theoretical optimum for 2-cyclic matrices.
If time allows, solution of elliptic Dirichlet and Neumann BVPs; chessboard enumeration; Richardson extrapolation.
|Delivery type||Number||Length hours||Student hours|
|Independent online learning hours||55.00|
|Private study hours||73.00|
|Total Contact hours||22.00|
|Total hours (100hr per 10 credits)||150.00|
Opportunities for Formative FeedbackInteraction with module manager through regular practical classes. Assessment of success on example sheets.
Methods of assessment
|Exam type||Exam duration||% of formal assessment|
|Standard exam (closed essays, MCQs etc)||2 hr 00 mins||100.00|
|Total percentage (Assessment Exams)||100.00|
Normally resits will be assessed by the same methodology as the first attempt, unless otherwise stated
Reading listThere is no reading list for this module
Last updated: 29/03/2022 15:20:27
Browse Other Catalogues
- Undergraduate module catalogue
- Taught Postgraduate module catalogue
- Undergraduate programme catalogue
- Taught Postgraduate programme catalogue
Errors, omissions, failed links etc should be notified to the Catalogue Team.PROD