Computer Laboratory Home Page Search A-Z Directory Help
University of Cambridge Home Computer Laboratory
Computer Science Syllabus - Numerical Analysis II
Computer Laboratory > Computer Science Syllabus - Numerical Analysis II

Numerical Analysis II next up previous contents
Next: Optimising Compilers Up: Lent Term 2006: Part Previous: Computer Vision   Contents

Numerical Analysis II

Lecturer: Dr M.R. O'Donohoe

No. of lectures: 12

Prerequisite course: Numerical Analysis I


This course will build on the foundation of Numerical Analysis I and provide more mathematical analysis to cover a much wider range of problems and techniques. It will blend theory and practice in order to provide a usefully broad body of knowledge.


  • Elementary approximation theory. Polynomial approximation; Taylor series; interpolation; best approximations; Chebyshev polynomials; Chebyshev series; economisation; least-squares approximation; the Gram-Schmidt process; range reduction; square roots; splines. [3.7 lectures]

  • Quadrature. Riemann sum rules; calculation of weights; error analysis; Gaussian quadrature; composite rules; singular integrals; multi-dimensional integration; standard regions; product rules; Monte Carlo methods. [2.3 lectures]

  • Non-linear equations and optimisation. Non-linear equations in one variable; simple iterative methods; fixed-point iteration theory; zeros of polynomials; unconstrained optimisation; Newton methods; steepest descent methods. [2 lectures]

  • Numerical linear algebra. Calculation of eigenvalues and eigenvectors; effective rank of a matrix; generalised inverse matrices; singular value decomposition; matrix norms; condition of linear equations. [2 lectures]

  • Differential equations. Initial value problems; Euler's method; Runge-Kutta methods; multistep methods; predictor-corrector methods; stability theory; stiff systems. [2 lectures]


At the end of the course students should

  • have an understanding of basic approximation theory and its extension to quadrature, fixed-point iteration theory, and elementary stability theory for numerical solution of initial value ordinary differential equations

  • be able to apply several advanced numerical methods, such as singular value decomposition

  • be able to make an informed choice, in several problem areas, between diverse methods commonly available in numerical software libraries

Recommended reading

Conte, S.D. & Boor, C. de (1980). Elementary numerical analysis. McGraw-Hill.
Shampine, L.F., Allen, R.C. Jr & Pruess, S. (1997). Fundamentals of numerical computing. Wiley.

next up previous contents
Next: Optimising Compilers Up: Lent Term 2006: Part Previous: Computer Vision   Contents
Christine Northeast
Sun Sep 11 15:46:50 BST 2005