Numerical Analysis (MAGIC066)
There are no announcements
This course is part of the MAGIC core.Semester
Autumn 2011 (Monday, October 10 to Friday, December 16)Timetable
No prerequisites information is available yet.
1. Introduction and general overview. 2. Approximation Theory. The Fast Fourier transform. 3. Methods for solving systems of linear and nonlinear equations. Gauss elimination, pivoting. Cholesky factorisation. Conditioning and error analysis. Least squares solution, Schur decomposition, the QR and QZ algorithms. Iterative methods: Jacobi, Gauss-Seidel, SOR. The Conjugate Gradient Method. Krylov subspace methods: Arnoldi algorithm. Conjugate gradient method and GMRES. 4. Numerical methods for ODEs. Taylor series methods. Runge-Kutta methods. Multi-step methods. Boundary value problems: shooting methods, finite difference methods, collocation. Methods for conservative and stiff problems. 5. Numerical methods for PDEs. Finite difference methods for elliptic equations. Parabolic equations: explicit, implicit and the Crank-Nicolson methods. The Galerkin, finite element and spectral methods.
Clicking on the link for a book will take you to the relevant Google Book Search page. You may be able to preview the book there. On the right hand side you will see links to places where you can buy the book. There is also link marked 'Find this book in a library'. This sometimes works well, but not always. (You will need to enter your location, but it will be saved after you do that for the first time.)
There will be two assessments for this course with each carrying a weight of 50
MAGIC066: Numerical Analysis Assessment 1
Numerical Analysis - Assessment 2
Files marked L are intended to be displayed on the main screen during lectures.