1. Representation of figures in computer arithmetic
2. Interpolation and extrapolation
3. Searching for roots
4. Minimization and maximization
5. Integration of functions
6. Solution of systems of linear equation
7. Solution of eigenvalue and singular value problems
8. Solution of ordinary differtential equations
9. Solution of integral equations

• W. H. Press, S. A. Teukolsky, W. T. Vetterling, B. P. Flannery, “Numerical Recipies”, Cambridge University Press
• N. Köckler, „Numerische Algorithmen in Softwaresystemen“, Teubner, 1990

• J. Stoer, „Einführung in die Numerische Mathematik I“, Springer Verlag, 1983 (ggf. neuere Auflage)
• J. Stoer, R. Bulirsch, „Einführung in die Numerische Mathematik II“, Springer Verlag, 1978 (ggf. neuere Auflage)

This module is a non-compensable obligatory module. It is passed if

1. lectures and tutorials were attended regularly and successfully (at least 50% of the in the tutorials accessible points have to be gained)
2. the test was passed. If the test is not passed there will be the opportunity for a timely re-test (written or oral). If the re-test is not passed it is recommend to retry the course of module with a subsequent second re-test. If the second re-test is failed the module is not passed finally.

• Knowledge of basics of numeric
• Knowledge of the most important numerical algorithms
• Ability to solve general mathematical problems numerically

Passed modules:

1. Mathematik für Physiker I
2. Mathematik für Physiker II
3. Datenverarbeitung und Programmieren

• Basic knowledge to use and evaluate numerical algorithms