Numerische Programmierung 1 (CSE)

What it is about

In this module you learn fundamental methods of numerical analysis: analysis of rounding errors and stability, methods for solving linear systems and eigenvalue problems, interpolation, numerical integration, as well as iterative and time integration procedures. By the end you will be able to understand the mathematical principles of these algorithms, explain their properties, and apply them to concrete examples.

What you will be able to do

Understanding error analysis, condition numbers and floating-point arithmetic
Solving linear systems (e.g. Gaussian elimination, least-squares problems)
Classifying and solving eigenvalue problems
Applying interpolation methods (algebraic, trigonometric, splines)
Performing numerical integration (summation rules, Gaussian quadrature)
Implementing iterative methods (Jacobi, Gauss-Seidel, CG, Newton)
Understanding time integration methods (e.g. Runge-Kutta)

What the module consists of

LectureConveying the mathematical foundations and algorithms
Exercises/TutorialsSolving concrete numerical tasks and discussing selected examples

Teaching method

LectureIntroduction to theory and methods
Tutorials/ExercisesDeepening through practical tasks and examples
Self-study of literatureIndependent deepening of the topics

Dates

LectureNumerical Programming 1 (CSE) [MA3305, IN2156]2 groups to choose from

AWed12:00–14:00
00.06.011, MI Hörsaal 3 (5606.EG.011)
15× · 14.10.–03.02.
- 14.10.
- 21.10.
- 28.10.
- 04.11.
- 11.11.
- 18.11.
- 25.11.
- 02.12.
- 09.12.
- 16.12.
- 23.12.
- 13.01.
- 20.01.
- 27.01.
- 03.02.
BMon14:00–16:00
00.04.011, MI Hörsaal 2 (5604.EG.011)
15× · 12.10.–01.02.
- 12.10.
- 19.10.
- 26.10.
- 02.11.
- 09.11.
- 16.11.
- 23.11.
- 30.11.
- 07.12.
- 14.12.
- 21.12.
- 11.01.
- 18.01.
- 25.01.
- 01.02.

From the current semester, not binding. You attend one of several groups; the timetable automatically suggests the one with the fewest clashes.

Filters