Numerical Linear Algebra
|Unit level:||Level 4|
|Teaching period(s):||Semester 1|
|Offered by||School of Mathematics|
|Available as a free choice unit?:||N
Students are not permitted to take, for credit, MATH46101 in an undergraduate programme and then MATH66101 in a postgraduate programme at the University of Manchester, as the courses are identical.
To develop understanding of modern methods of numerical linear algebra for solving linear systems, least squares problems and the eigenvalue problem.
This module treats the main classes of problems in numerical linear algebra: linear systems, least square problems, and eigenvalue problems, covering both dense and sparse matrices. It provides analysis of the problems along with algorithms for their solution. It also uses MATLAB as tool for expressing and implementing algorithms and describes some of the key ideas used in developing high-performance linear algebra codes. Applications, such as machine learning and search engines, will be introduced throughout the module.
Teaching and learning methods
30 lectures (two or three lectures per week), with a fortnightly examples class.
On successful completion of this course unit students will
- understand the concepts of efficiency and stability of algorithms in numerical linear algebra;
- understand the importance of matrix factorizations, and know how to construct some key factorizations using elementary transformations;
- be familiar with some important methods for solving linear systems, least squares problems, and the eigenvalue problem;
- appreciate the issues involved in the choice of algorithm for particular problems (sparsity, structure, etc.);
- appreciate the basic concepts involved in the efficient implementation of algorithms in a high-level language.
- Other - 25%
- Written exam - 75%
Assessment Further Information
- Mid-semester coursework: 25%
- End of semester examination: three hours weighting 75%
1. Basics. Summary/recap of basic concepts from linear algebra and numerical analysis: matrices, operation counts. Matrix multiplication, block matrices. 
Matrix norms. Linear system sensitivity. 
2. Matrix factorizations. Cholesky factorization. QR factorization by Householder matrices and by Givens rotations. 
LU factorization and Gaussian elimination; partial pivoting. Solving triangular systems by substitution. Solving full systems by factorization. Error analysis. Complete pivoting, rook pivoting. Numerical examples. 
3. Sparse and banded linear systems and iterative methods. Storage schemes for banded and sparse matrices. LU Factorization, Markowitz pivoting. 
Iterative methods: Jacobi, Gauss-Seidel and SOR iterations. Kronecker product. Krylov subspace methods, conjugate gradient method. Preconditioning. 
4. Linear least squares problem. Basic theory using singular value decomposition (SVD) and pseudoinverse. Perturbation theory. Numerical solution: normal equations. SVD and rank deficiency. 
5. Eigenvalue problem. Basic theory, including perturbation results. Power method, inverse iteration. Similarity reduction. QR algorithm. 
 Timothy A. Davis, Direct Methods for Sparse Linear Systems, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2006, ISBN 0-89871-613-6, xii+217pp.
 James W. Demmel, Applied Numerical Linear Algebra, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1997, ISBN 0-89871-389-7, xi+419pp.
 Gene H. Golub and Charles F. Van~Loan, Matrix Computations, Johns Hopkins University Press, Baltimore, MD, USA, fourth edition, 2013, ISBN 978-1-4214-0794-4. xxi+756pp.
 Desmond J. Higham and Nicholas J. Higham, MATLAB Guide, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, third edition, 2017, ISBN 978-1-61197-465-2. xxvi+476pp.
 Nicholas J. Higham, Accuracy and Stability of Numerical Algorithms, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, second edition, 2002, ISBN 0-89871-521-0, xxx+680pp.
 Yousef Saad. Iterative Methods for Sparse Linear Systems. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, second edition, 2003. ISBN 0-89871-534-2. xviii+528pp.
 G. W. Stewart, Introduction to Matrix Computations, Academic Press, New York, 1973, ISBN 0-12-670350-7, xiii+441pp.
 G. W. Stewart, Matrix Algorithms, Volume I: Basic Decompositions, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1998, ISBN 0-89871-414-1, xx+458pp.
 G. W. Stewart, Matrix Algorithms, Volume II: Eigensystems, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2001, ISBN 0-89871-503-2, xix+469pp.
 Lloyd N. Trefethen and David Bau III, Numerical Linear Algebra, Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 1997, ISBN 0-89871-361-7, xii+361pp.
 David S. Watkins, Fundamentals of Matrix Computations, Wiley, New York, third edition, 2010, ISBN 978-0-470-52833-4. xvi+644pp.
Feedback tutorials will provide an opportunity for students' work to be discussed and provide feedback on their understanding. Coursework or in-class tests (where applicable) also provide an opportunity for students to receive feedback. Students can also get feedback on their understanding directly from the lecturer, for example during the lecturer's office hour.
- Assessment practical exam - 40 hours
- Lectures - 30 hours
- Tutorials - 12 hours
- Independent study hours - 68 hours