Domain Decomposition Methods

Lecturer:

Pavel Burda

Tutor:

Pavel Burda

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:

Time-table for winter semester 2011/2012:

Time-table is not available yet

Time-table for summer semester 2011/2012:

Time-table is not available yet

The course is a part of the following study plans: