Skip to main content
This material has been adapted from material by Martin Robinson from the "Scientific Computing" module of the SABS R³ Center for Doctoral Training.

This material has been adapted from material by Martin Robinson from the "Scientific Computing" module of the SABS R³ Center for Doctoral Training.

Creative Commons License
This course material was developed as part of UNIVERSE-HPC, which is funded through the SPF ExCALIBUR programme under grant number EP/W035731/1

This course material was developed as part of UNIVERSE-HPC, which is funded through the SPF ExCALIBUR programme under grant number EP/W035731/1

Creative Commons License

Sparse Matrices and Iterative Solvers

View Course Diagram

Many problems in science and engineering involve the solution of large systems of linear equations that are sparse, i.e. most of the entries in the matrix are zero. In this case, it is often more efficient to use iterative methods to solve the system of equations, rather than the direct methods covered in the previous course. This course covers the basics of iterative methods for solving linear systems, and how to use sparse matrices to represent and solve these systems efficiently.