SubjectsSubjects(version: 945)
Course, academic year 2023/2024
   Login via CAS
Algorithms for matrix iterative methods - NMNV411
Title: Algoritmy maticových iteračních metod
Guaranteed by: Department of Numerical Mathematics (32-KNM)
Faculty: Faculty of Mathematics and Physics
Actual: from 2021
Semester: winter
E-Credits: 5
Hours per week, examination: winter s.:2/2, C+Ex [HT]
Capacity: unlimited
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: yes / unlimited
Key competences: data literacy, 4EU+ Flagship 3
State of the course: taught
Language: English
Teaching methods: full-time
Teaching methods: full-time
Additional information:
Guarantor: doc. RNDr. Iveta Hnětynková, Ph.D.
Class: M Mgr. MMIB > Povinně volitelné
M Mgr. MOD > Povinné
M Mgr. NVM > Povinné
Classification: Mathematics > Numerical Analysis
Is interchangeable with: NMNV438
Annotation -
Last update: doc. RNDr. Václav Kučera, Ph.D. (05.12.2018)
The course is devoted to the most widely used iterative methods for solving systems of linear algebraic equations, linear approximation problems, eigenvalue problems, etc., including preconditioning. The emphasis is put especially on effective algorithmic realization and study of convergence properties.
Course completion requirements -
Last update: doc. RNDr. Iveta Hnětynková, Ph.D. (07.09.2020)

To finish the course successfully, it is required to pass the exam covering all presented topics, see "Requirements to the exam".

Furthermore, students will complete one homework assignments during the semester. The homework consists of implementing a selected method in the MATLAB environment.

Literature -
Last update: Stefano Pozza, Dr., Ph.D. (07.09.2020)

Saad, Y.: Iterative methods for sparse linear systems, SIAM, Philadelphia, 2003 (2nd ed.).

Liesen, J., Strakos, Z.: Krylov Subspace Methods, Oxford University Press, 2012.

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.

Teaching methods -
Last update: doc. RNDr. Iveta Hnětynková, Ph.D. (07.09.2020)

Lectures are held in a lecture hall, practicals in a computer laboratory (Matlab enviroment). In case of distance learning, online communication platforms will be used (e.g. MOODLE, ZOOM).

Requirements to the exam -
Last update: Stefano Pozza, Dr., Ph.D. (14.07.2021)

The exam reflects all the material presented in lectures and practicals during the whole semester. Critical thinking and data literacy, in the form of understanding the connection between data and methods, are also expected learning outcomes of the course. The exam has oral form.

When needed, it is possible to take the exams or credits in a distance form.

Syllabus -
Last update: Stefano Pozza, Dr., Ph.D. (07.09.2020)

1. Idea and basic principles of iterative methods. Introduction to work with sparse and structured matrices.

2. Methods for solving systems with symmetric matrices.

3. Methods for solving systems with nonsymmetric matrices based on orthogonality and long recurrences, and based on biorthogonality and short recurrences.

4. Methods for solving linear approximation and ill-posed problems.

5. Generalizations for problems with multiple observations - block and band methods.

6. Preconditioning - idea, selection, construction.

7. Convergence and numerical stability - comparison and examples.

8. Multigrid - idea.

Entry requirements -
Last update: doc. RNDr. Iveta Hnětynková, Ph.D. (07.09.2020)

Previous knowledge of linear algebra and basic methods for matrix computations is expected.

Charles University | Information system of Charles University |