VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.
Numerical Analysis
Numerische Mathematik
Last Updated: 2026-02-05 15:02:35
Abstract
This course covers two different areas of numerical analysis:1) Iterative methods for large sparse linear systems of equations.2) Numerical methods for ordinary differential equations and systems of such equations.
Objective
The students should learn the ideas on which the numerical methods in the two covered areas (iterative methods for linear equations and numerical methods for ordinary differential equations) are based on. Not only the motivation and derivation of algorithms matters, but also their analysis, like proofs of convergence.
Content
1) Iterative methods for large sparse linear systems of equations: Classical methods like Jacobi and Chebyshev iteration; the general notion of Krylov space methods; the conjugate gradient method; the connection with the symmetric Lanczos algorithm; the biconjugate gradient method; the Arnoldi process and the MinRes and GMRes algorithms. 2) Numerical methods for ordinary differential equations and systems of such equations: The classical Euler method and its convergence; Runge-Kutta methods; linear multistep methods; order of convergence and stability; stiff differential equations; A-stability.
Resources
Lecture Notes
1) My own script: Iterative Methods (in English).2) Various quite detailed scripts can be found on the internet.
General Information
- Language
- German
- Frequency
- Yearly recurring
Examination
- Type
- session examination
- Mode
- written 150 minutes
- Aids
- Handgeschriebene Zusammenfassung auf 10 Seiten A4; Taschenrechner (Programmierbarkeit unnötig).
Course Components
| Type | Title | Time & Place | Hours |
|---|---|---|---|
| lecture | Numerische Mathematik |
|
3 h weekly |
| exercise | Numerische Mathematik |
|
2 h weekly |