|Module Title||NUMERICAL SOLUTION OF PARTIAL DIFFERENTIAL EQUATIONS|
|Co-ordinator||Professor T N Phillips|
|Other staff||Professor A R Davies|
|Course delivery||Lecture||19 x 1hour lectures|
|Seminars / Tutorials||3 x 1hour example classes|
|Assessment||Exam||2 Hours (written examination)||100%|
|Resit assessment||2 Hours (written examination)||100%|
Finite difference approximations to elliptic partial differential equations. Local truncation error and error analysis. Boundary conditions on a curved boundary. Variational formulation and the finite element method. Classical iterative methods for solving linear systems of algebraic equations: Jacobi, Gauss-Seidel, SOR. Fourier analysis of convergence.
Finite difference approximations to parabolic partial differential equations in one space variable. Local truncation error and error analysis. Explicit and implicit methods. Convergence and stability. The Thomas algorithm.
The aim of this course is to provide an introduction to numerical methods for solving partial differential equations of elliptic and parabolic type. Concepts such as consistency, convergence and stability of numerical methods will be discussed. Classical iterative methods for solving the systems of linear algebraic equations arising from the discretization of elliptic problems will be described and their convergence behaviour analysed.
On completion of this module, a student should be able to:
** Recommended Text
K W Morton and D F Mayers. (1994) Numerical Solution of Partial Differential Equations. Cambridge University Press
G D Smith. (1978) Numerical Solution of Partial Differential Equations: Finite Difference Methods. Oxford University Press