Hermann Schwarz

Domain Decomposition Methods


Domain Decomposition Method Logonon-overlapping Domains Logo overlapping Domains Logo
last update: 2021-10-01

[ Lecture ] [ exam questions ] [ Exam Dates ] [ Transparencies ] [ Lecture Notes ] [ Software ] [ General ] [ Home ]

(CourseId 327.024, 2 hours per week, Semester 8)

Lecturer: O.Univ.-Prof. Dr. Ulrich Langer

Time and room:

Monday, March 02, 201515:30 - 17:00 Room: BA 9908 Lecture 01
Monday, March 09, 201515:30 - 17:00 Room: BA 9908 Lecture 02
Monday, March 16, 2015Canceled !
Monday, March 23, 201515:30 - 17:00 Room: BA 9908 Lecture 03
Tuesday, March 24, 201515:30 - 17:00 Room: S2 059 Lecture 04
Easter Break
Monday, April 13, 2015Canceled !
Monday, April 20, 201515:30 - 17:00 Room: BA 9908 Lecture 05
Tuesday, April 21, 201515:30 - 17:00 Room: S2 059 Lecture 06
Monday, June 29, 201515:30 - 17:00 Room: BA 9908 Lecture 07
Tuesday, June 30, 201513:45 - 15:15 Room: S2 416 Lecture 08
Monday, July 6, 201513:45 - 15:15 Room: BA 9907 Lecture 09
Tuesday, July 7, 201513:45 - 15:15 Room: BA 9907 Lecture 10
Thursday, July 9, 201510:15 - 11:45 Room: BA 9907 Lecture 11
Thursday, July 9, 201513:45 - 15:15 Room: BA 9907 Lecture 12
Friday, July 10, 201510:15 - 11:45 Room: BA 9907 Lecture 13


- Exam Questions: up
as   pdf-file  

- Exam Dates: up
Link to the Exam Dates


- Transparencies:
up

Transparency 1: colourH.A. Schwarz, 1869: AltSM
Transparency 2: colourS.L. Sobolev, 1936: VF AltSM
Transparency 3: colourIterative Substructuring
Transparency 4: colour2.3. Overlappping and Non-overlapping DDMs
Transparency 5: colourAlgorithm 3.1. ASM
Transparency 6: colourAlgorithm 3.2. MSM
Transparency 7: colourAlgorithm 3.3. A Hybrid Schwarz Method
Transparency 8: colourIllustration ASM and MSM
Transparency 9: colourTheorem 3.23: Proof (1)
Transparency 10: colourTheorem 3.23: Proof (2)
Transparency 11: colourTheorem 3.23: Proof (3)
Transparency 12: colourTheorem 3.23: Proof (4)
Transparency 13: colourSummary: Multilevel ASM
Transparency 14: colourEx. 4.1, Rem. 4.6
Transparency 15: colour5.1.2.: TypeI: overlapping
Transparency 16: colour5.1.2.: TypeII: distributed
Transparency 17: colourDD Par(P)GG
Transparency 18: colourConvergence, Communication
Transparency 19: colourDD preconditioner
Transparency 20: colourLemma 5.4 + Proof
Transparency 21: colourProof (cont.)
Appendix A1: colour

- Basic Lecture Notes:
up

Lectures on DD-Methods as Postscript file or as gzip file
see   http://www.numa.uni-linz.ac.at/Teaching/Notes/  

- Additional Literature:
up

DD Monographs:
[1]   Korneev V.G. and Langer U. Dirichlet-Dirichlet Domain Decomposition Methods for Elliptic Problems: h and hp Finite Element Discretizations. World Scientific Publishing Company Incorporated, New Jersey - London - Singapore, 2015.
[2]   Mathew, T. (2008). Domain Decomposition Methods for the Numerical Solution of Partial Differential Equations, Lecture Notes in Computational Science and Engineering, Vol. 61 (Springer, Berlin - Heidelberg).
[3]   Pechstein, C. (2013). Finite and Boundary Element Tearing and Interconnecting Solvers for Multiscale Problems, Lecture Notes in Computational Science and Engineering, Vol. 90 (Springer, Berlin-Heidelberg).
[4]   Quarteroni, A. and Vali, A. (1999). Domain Decomposition Methods for Partial Differential Equations (Oxfort Sciences Publications).
[5]   Smith B, Bjørstad P and Gropp W. Domain Decomposition: Parallel Multilevel Methods for Elliptic Partial Differential Equations. Cambridge University Press, 1996.
[6]   Toselli, A. and Widlund, O. (2005). Domain Decoposition Methods - Algo- rithms and Theory, Springer Series in Computational Mathematics, Vol. 34 (Springer, Berlin, Heidelberg).
Book FEM

DD Survey Articles:
[1]   Korneev, V. and Langer, U. (2004). Domain decomposition and preconditioning, in E. Stein, R. de Borst and T. Hughes (eds.), Encyclopedia of Computa- tional Mechanics. Vol 1 : Fundamentals, Chapter 22, Vol. 1 (John Wiley & Sons), pp. 617–647.

- Software:
up

- Links:
up


- General Information:
up

Previous Knowledge:

Is required for:

Objective:

Get knowledge of Domain Decomposition Methods that are the most efficient methods for the parallel numerical solution of Partial Differential Equations and that are the most important tolls for the numerical treatment of multiphysics problems.

Contents:

Examinations:

oral