Skip to main content

MA398 Content

Content: Large scale problems in linear algebra as solving systems of linear equations, least-squares problems, and eigenvalue problems lie at the heart of many algorithms in scientific computing and require highly efficient solvers. The module will be based around understanding the mathematical principles underlying the design and the analysis of effective methods and algorithms.

Aims: Understanding how to construct algorithms for solving some problems central in numerical linear algebra and to analyse them with respect to accuracy and computational cost.

Objectives: At the end of the module you will familiar with concepts and ideas related to:

  1. various matrix factorisations as the theoretical basis for algorithms,
  2. assessing algorithms with respect to computational cost,
  3. conditioning of problems and stability of algorithms,
  4. direct versus iterative methods.


AM Stuart and J Voss, Matrix Analysis and Algorithms, script.

G Golub and C van Loan, Matrix Computations, 3. ed., Johns Hopkins Univ. Press, London 1996.

NJ Higham, Accuracy and Stability of Numerical Algorithms, SIAM 1996.

RA Horn and CR Johnson, Matrix Analysis, Cambridge University Press 1985.

D Kincaid and W Cheney, Numerical Analysis, 3. ed., AMS 2002.

LN Trefethen and D Bau, Numerical Linear Algebra, SIAM 1997.