There are two rounds of talks. Each of the participants will give a presentation of 45 minutes in each of the rounds.
Use the first week to understand the mathematics and to get a clear view on what the highlights are and what side issues.
Use the second week to find clear but concise explanations and illuminating examples: you should avoid (proofs with) technical details in your talk, unless the details are essential for (understand) the theory. Often an example is more instructive then a proof. Nevertheless you should also understand the details: the audience might be interested!
The third week is for making your talk. You have to organize your talk (what should go in the introduction, what in the kernel, ...), to decide on what you put on transparencies (highlights in order to more clearly bring out the overview, technical details to avoid errors and boring copying from paper to blackboard, ...) and what you write on the blackboard (some aspects require slow digestion). And, of course, you have to make the transparencies and prepare clear but concise formulations: your talk should fit in a 45 minute timeslot. You should realize that the audience will welcome an early stop, but may stop paying attention if you take more time.
Do not forget to address in your talk the important questions: ``Why would you like to have a new theory or a new method? What is lacking in the old ones?'', ``Does the new theory (method) solve all problems?''
Do not hesitate to contact the teachers, not only for mathematical details, but also for the overview, illuminating examples or structuring the talk: the quality of your talk determines your grade, not the way you prepared your talk. Preparing a talk is part of the educational process.
Lecture 1: [ Tammo Jan Dijkema]
Krylov subspaces and basis for Krylov subspaces [31, Ch.3], effects of loss of orthogonality (see also the paper by Daniel, Gragg, Kaufmann and Stewart [9]. More information in [26,28,19,7,8,16,13,12,14]).
Lecture 2: [ Maartje Wessel]
Conjugate Gradients (CG), CG for least square systems, Graig's method [31, Ch.5]
Lecture 1: [ Eelco Nederkoorn]
Convergence CG, super linear convergence, consequences for CG for least square systems [31], [29]
Lecture 2: [ Tristan van Leeuwen]
No seminar.
No seminar
Lecture 1: [ Tammo Jan Dijkema]
FOM and GMRES [27], comparison GMRES, CG least squares, Bi-CG [25].
Lecture 2: [ Maartje Wessel]
Convergence GMRES [15].
Lecture 1: [ Eelco Nederkoorn]
Preconditioning I: Incomplete LU (ILU), modified ILU (MILU) [24], [18] (see also [31, Ch.13]).
Lecture 2: [ Tristan van Leeuwen]
Preconditioning II: Sparse approximate inverse (SPAI) [17] ([20]),[4], [22] ([21]).
Next: Bibliography
Up: Schedule
Previous: Schedule