You are here: Mathematics > undergraduate > undergraduate studies > course units > level 2 units > MATH20602
School of Mathematics

MATH20602 - 2007/2008

General Information
  • Title: Numerical Analysis
  • Unit code: MATH20602
  • Credit rating: 10
  • Level: 2
  • Pre-requisite units: MATH20401 or MATH20411
  • Co-requisite units:
  • School responsible: Mathematics
  • Members of staff responsible: Dr. Tony Shardlow
Page Contents
Other Resources

 

Unit specification

Aims

The programme unit aims to introduce students to theoretical and practical aspects of the numerical solution of linear and nonlinear equations, the approximation of functions by polynomials and the approximation of integrals via quadrature schemes.

Brief description

Numerical analysis is concerned with finding numerical solutions to problems for which analytical solutions either do not exist or are not readily or cheaply obtainable. This course provides an introduction to the subject, focusing on the three core topics of iteration, interpolation and quadrature.

The module starts with 'interpolation schemes', methods for approximating functions by polynomials, and 'quadrature schemes', numerical methods for approximating integrals, will then be explored in turn. The second half of the module looks at solving systems of linear and nonlinear equations via iterative techniques. In the case of linear systems, examples will be drawn from the numerical solution of differential equations.

Students will learn about practical and theoretical aspects of all the algorithms. Insight into the algorithms will be given through MATLAB illustrations, but the course does not require any programming.

Intended learning outcomes

On completion of this unit successful students will be able to:

Future topics requiring this course unit

Numerical Solution of Ordinary Differential Equations (level 3), Numerical Linear Algebra (level 4), Finite Element Method (level 4).

Syllabus

  1. Introduction to numerical analysis. Floating point arithmetic. Catastrophic cancellation and the quadratic equation formula. Efficiency and Horner's method. [2 lectures]
  2. Approximation. Lagrange interpolation. Uniqueness and existence of interpolants. Error estimates. Runge's example. Divided difference form of interpolant. Application to quadrature. [6]
  3. Linear Algebra. PDE example to introduce sparse matrices. Iterative vs direct methods. Examples of iterative methods (Jacobi, Gauss-Seidel). Vector Norms. Eigenvalues, eigenvectors, spectral radius. Convergence criteria. Error bounds, matrix norms, and condition number. [7]
  4. Solving nonlinear equations. Solution of nonlinear equations by the bisection method, fixed point iteration, and Newton's method. Discussion in one and two dimensions. [6]

Textbooks

Endre Suli and David Mayers, An Introduction to Numerical Analysis, Cambridge University Press 2003.
Richard L. Burden and J. Douglas Faires, Numerical Analysis, Brookes Cole 2004.
Desmond J. Higham and Nicholas J. Higham, MATLAB Guide, Second edition, SIAM 2005.

Learning and teaching processes

Two lectures and one examples class each week. In addition students should expect to do at least four hours work each week on this course unit.

Assessment

Coursework; Weighting within unit 20%
2 hours end of semester examination; Weighting within unit 80%

to the top

Arrangements

Online course materials are available for this unit.

Last modified: 1 November 2007.

Quick Links: