Numerics of Differential Equations
Module MA3301
This module handbook serves to describe contents, learning outcome, methods and examination type as well as linking to current dates for courses and module examination in the respective sections.
Module version of SS 2021 (current)
There are historic module descriptions of this module. A module description is valid until replaced by a newer one.
Whether the module’s courses are offered during a specific semester is listed in the section Courses, Learning and Teaching Methods and Literature below.
| available module versions | |
|---|---|
| SS 2021 | WS 2011/2 |
Basic Information
MA3301 is a semester module in English language at Master’s level which is offered in winter semester.
| Total workload | Contact hours | Credits (ECTS) |
|---|---|---|
| 270 h | 90 h | 9 CP |
Content, Learning Outcome and Preconditions
Content
non-stiff and stiff integration of initial value problems, introduction to boundary value problems and optimal control; introduction to the numerical solution of partial differential equations (finite differences, finite elements, spectral methods) with a focus on problems in one spatial dimension, 2D for elliptic boundary value problems
Learning Outcome
After successful completion of this module the students are able to understand, to judge and to apply basic algorithms for the numerical solution of ordinary and partial differential equations. Students know and can apply the basic techniques for the assessment of discretization errors. They have learnt to think algorithmically and to realise complex algorithms on the computer.
Preconditions
MA0001 Analysis 1, MA0002 Analysis 2, MA0004 Linear Algebra 1, MA0005 Linear Algebra 2 and Discrete Structures, MA0008 Numerical Analysis
Courses, Learning and Teaching Methods and Literature
Courses and Schedule
| Type | SWS | Title | Lecturer(s) | Dates | Links |
|---|---|---|---|---|---|
| VO | 4 | Numerics of Differential Equations | Bornemann, F. Ludwig, C. |
eLearning |
|
| TT | 2 | Exercises for Numerics of Differential Equations | Bornemann, F. Ludwig, C. |
documents |
Learning and Teaching Methods
lecture, exercise module, assignments and programming for self-study
The module is offered as lectures with accompanying practice sessions. In the lectures, the contents will be presented in a talk with demonstrative examples, as well as through discussion with the students. The lectures should motivate the students to carry out their own analysis of the themes presented and to independently study the relevant literature. Corresponding to each lecture, practice sessions will be offered, in which exercise sheets and solutions will be available. In this way, students can deepen their understanding of the methods and concepts taught in the lectures and independently check their progress.
The module is offered as lectures with accompanying practice sessions. In the lectures, the contents will be presented in a talk with demonstrative examples, as well as through discussion with the students. The lectures should motivate the students to carry out their own analysis of the themes presented and to independently study the relevant literature. Corresponding to each lecture, practice sessions will be offered, in which exercise sheets and solutions will be available. In this way, students can deepen their understanding of the methods and concepts taught in the lectures and independently check their progress.
Media
blackboard, computer experiments
Literature
- Deuflhard, Bornemann: Numerische Mathematik 2, 3. Auflage, de Gruyter 2008.
- Quarteroni, Sacco, Saleri: Numerische Mathematik 2, Springer 2002.
- Iserles, A.: A first course in the numerical analysis of differential equations. Cambridge University Press, Cambridge, 1996.
- Quarteroni, Sacco, Saleri: Numerische Mathematik 2, Springer 2002.
- Iserles, A.: A first course in the numerical analysis of differential equations. Cambridge University Press, Cambridge, 1996.
Module Exam
Description of exams and course work
The module examination is based on a written exam (90 minutes). In the exam it will be assessed to which extent the students have understood the algorithmic numerical way of thinking by means of basic algorithms. Students have to show in a limited amount of time that they know and can apply basic techniques for the evaluation of the efficiency and accuracy of numerical algorithms and the estimation of approximation errors.
Exam Repetition
The exam may be repeated at the end of the semester.