Algorithms for matrix iterative methods 2025/2026

Course Journal

Last update: 26/09/25

Lab 1 - 29/09/2025

Introduction

Exam:

The exam will cover all the material presented in lectures and practicals throughout the semester and will be conducted in oral form.

In addition, students are required to complete one homework assignment during the semester. The assignment is a team project, in which each team must reproduce, using MATLAB, the experiments described in an assigned research article.

A map of iterative methods studied in the course

Scheme MIM 2.pdf

Matlab

Here is a useful summary of Matlab's basic functions.

Here is Matlab Onramp, a 2 hours online introduction with useful exercises.

Materials and literature:

Literature:

[SB] Y. Saad: Iterative methods for sparse linear systems, SIAM, Philadelphia, 2003. (Main source) [Library]
An open free version can be downloaded here.
[LSB] J. Liesen and Z. Strakos, Krylov Subspace Methods, Principles and Analysis, Oxford University Press, 2012, 408p. [Library]
Barrert, R., et all: Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods, SIAM, Philadelphia, 1994.
Higham, N.: Accuracy and stability of numerical algorithms, SIAM, Philadelphia, 2002 (2nd ed.).
Meurant, G.: Computer solution of large linear systems, Studies in Mathematics and Its Applications, North-Holland, 1999.

Material discussed in class (in order of appearance):

Google Sites

Report abuse