Logo ČVUT
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2019/2020

Domain Decomposition Methods

The course is not on the list Without time-table
Code Completion Credits Range
W01O002 ZK 45
Lecturer:
Tutor:
Supervisor:
Department of Technical Mathematics
Synopsis:

Fast iterative and hybrid algorithms. Variants of the domain decomposition method, aggregation. Parallel implementation.

Requirements:
Syllabus of lectures:

1 - 5. Domain decomposition Metod. Neumann-Neumann conditions on the interface. Properties of the algorithm. Stabilization of the algorithm-balancing of corrections. Comparison with „classical“ multigrid techniques.

6. - 9. General multilevel methods. Abstract theory.

10. - 14. Problems with nonsmooth data. Homogenization as two-level process.

Syllabus of tutorials:

1 - 5. Domain decomposition Metod. Neumann-Neumann conditions on the interface. Properties of the algorithm. Stabilization of the algorithm-balancing of corrections. Comparison with „classical“ multigrid techniques.

6. - 9. General multilevel methods. Abstract theory.

10. - 14. Problems with nonsmooth data. Homogenization as two-level process.

Study Objective:
Study materials:

Hackbusch W.: Multigrid Methods. Springer Verlag, Berlin-Heidelberg-New York, l988

Multigrid Methods. Lecture Notes in Mathematics, Vo.96O. Springer Verlag Berlin-Heidelberg-New York, l982. Editoři Hackbusch W., a Trottenberg U.

Note:
Further information:
No time-table has been prepared for this course
The course is a part of the following study plans:
Data valid to 2019-09-17
For updated information see http://bilakniha.cvut.cz/en/predmet10866402.html