Basic Numerical Methods

Basic Numerical Methods

Upon completing this module, the students will acquire the basics of numerical mathematics and numerical simulation methods. This includes the theoretical understanding of how a computer calculates with finite floating-point numbers and what kind of errors and inaccuracies may arise from these, and how to reduce or control them same. They will be familiar with basic numerical methods for modelling and simulating statistical models, linear algebra models, and ordinary and partial differential equations. They will be able to estimate the approximation errors of the methods and determine the algorithmic intensity, and will be able to implement these methods themselves.


Contents

Floating point arithmetic, rounding errors, cancellation, numerical interpolation (Lagrange, Newton, Splines), Taylor developments, finite differences and their approximation errors, explicit and implicit time integrators, direct and iterative algorithms for matrix inversion, matrix decomposition (LU), solution for the Poisson equation.


Program / Module

M.Sc. Computational Modeling and Simulation
Module: CMS-COR-NUM - Basic Numerical Methods


Time/Place
Winter Term

Lecture: Mondays, 5. DS (14:50-16:20) in SCH-A316 (Georg-Schumann-Bau) / FIRST LECTURE: OCT 14
Exercises: Thursday, 3. DS (11:10-12:40) in WIL-C107 (Willers-Bau) in even weeks, ZEU-160 (Zeuner-Bau) in odd weeks. 17.10.2019: VMB/0E02/U (von-Mises-Bau)


Format

2 SWS lecture, 2 SWS exercise, self-study

5 credits


Exam

Thursday, February 21, 2019, 09:20-10:50h, APB/E006 (computer science building)

If there are more than 10 registered students, the module examination consists of a written examination, with a duration of 90 minutes. If there are 10 or fewer registered students, it consists of an oral examination as an individual examination performance amounting to 30 minutes; this will be announced to the enrolled students at the end of the enrollment period.

At the exam, the following may be used:

  • 4 A4 sheets (8 pages if you print duplex) of hand-written summary. We recommend writing the summary by hand, but it can also be machine-written. In the latter case, the font size must be 8 points or larger throughout.
  • A standard pocket calculator (devices with network or bluetooth access, as well as devices capable of storing and displaying documents are not allowed)
Items not adhering to these guidelines will be confiscated in their entirety at the beginning of the exam.


Exam Review

You can come and look at your exam, and ask questions about its correction and the answers given during the following times:


  • April 15, 11am
  • April 17, 2pm
  • April 23, 5pm

All exam check session are going to happen at the CSBD (Pfotenhauerstr. 108) in the rooms of the Professorship.


Registration to the course

For students of the Master program "Computational Modeling and Simulation: via CampusNet SELMA

For students of the Computer Science programs: via jExam


Teachers

Lecture: Prof. Ivo F. Sbalzarini
Exercises: Abhinav Singh


Teaching language: ENGLISH


Lecture notes are available as PDF here.
Below is the weekly syllabus and the exercise/solution handouts:

  • Lecture 1 - finite-precision arithmetics, IEEE number representation, roundoff and extinction, error propagation, condition numbers, backward error analysis (Exercise 01 PDF ATTENTION: EXERCISE SESSION IS IN ROOM VMB/0E02/U (von-Mises-Bau))
  • Lecture 2 - linear systems of equations, LU decomposition of matrices, Gaussian elimination, iterative linear solvers, Jacobi method
  • Lecture 3 - Gauss-Seidel method, SOR method, Conjugate gradient methods, preconditioning schemes
  • Lecture 4 - Least-Squares methods, QR decomposition, singular value decomposition
  • Lecture 5 - Non-linear least squares, non-linear equations, Newton method, bisection method, secant method
  • Lecture 6 - Non-linear systems of equations, quasi-Newton method, rank-1 update, Broyden algorithm, Lagrange interpolation, barycentric interpolation
  • Lecture 7 - Interpolation algorithms: Aitken-Neville algorithm, Hermite and Spline interpolation
  • Lecture 8 - Trigonometric interpolation: Discrete Fourier transform and fast Fourier transform algorithms
  • Lecture 9 - Numerical integration (quadrature): trapezoidal rule, Simpson rule, Romberg extrapolation, Gauss quadrature
  • Lecture 10 - Numerical differentiation: finite difference methods, Romberg extrapolation, Initial value problems of ordinary differential equations, the explicit Euler scheme
  • Lecture 11 - second-order schemes, Heun's method, Runge-Kutta schemes, variable step size control, Richardson extrapolation
  • Lecture 12 - implicit schemes, Systems of ODEs, Adams-Bashforth formula
  • Lecture 13 - numerical stability, stiff problems, partial differential equations introduction
  • Lecture 14 - Partial differential equations 1: parabolic problems, elliptic problems
  • Lecture 15 - Partial differential equations 2: hyperbolic problems, Courant-Friedrichs-Levy condition