Preliminary course catalogue - changes and additions are still possible.
Click on the course title for more information!
New (and partly not yet in den annotated course catalogue):
Introduction to Theory and Numerics of Partial Differential Equations
Lecturer: Patrick Dondl
Assistant: Ludwig Striet, Oliver Suchan
Language: in English
Lecture: Mo, Mi, 12-14h, HS II, Albertstr. 23b
Tutorial: 2 hours, date to be determined
The aim of this course is to give an introduction into theory of linear partial differential equations and their finite difference as well as finite element approximations. Finite element methods for approximating partial differential equations have reached a high degree of maturity, and are an indispensable tool in science and technology. We provide an introduction to the construction, analysis, and implementation of finite element methods for different model problems. We will address elementary properties of linear partial differential equations along with their basic numerical approximation, the functional-analytical framework for rigorously establishing existence of solutions, and the construction and analysis of basic finite element methods.
Required: Analysis~I and II, Linear Algebra~I and II as well as knowledge about higher-dimensional integration (e.g. from Analysis~III or from Further Chapters in Analysis) \
Recommended: Numerics for differential equations, Functional analysis
Applied Mathematics
Elective
Mathematics
Concentration Module
Mathematical Statistics
Lecturer: Ernst August v. Hammerstein
Language: in English
Lecture: Di, Do, 14-16h, SR 404, Ernst-Zermelo-Str. 1
Tutorial: 2 hours, date to be determined
The lecture builds on basic knowledge about Probability Theory. The fundamental problem of statistics is to infer from a sample of observations as precise as possible statements about the data-generating process or the underlying distributions of the data. For this purpose, the most important methods from statistical decision theory such as test and estimation methods are introduced in the lecture.
Key words hereto include Bayes estimators and tests, Neyman-Pearson test theory, maximum likelihood estimators, UMVU estimators, exponential families, linear models. Other topics include ordering principles for reducing the complexity of models (sufficiency and invariance).
Statistical methods and procedures are used not only in the natural sciences and medicine, but in almost all areas in which data is collected and analyzed This includes, for example, economics (“econometrics”) and the social sciences (especially psychology). However, in the context of this lecture, we will focus less on applications, but---as the name suggests---more on the mathematical justification of the methods.
Probability Theory (in particular measure theory and conditional probabilities/expectations)
Applied Mathematics
Elective
Mathematics
Concentration Module
Probabilistic Machine Learning
Lecturer: Giuseppe Genovese
Language: in English
Lecture: Di, Do, 12-14h, HS II, Albertstr. 23b
Tutorial: 2 hours, date to be determined
The goal of the course is to provide a mathematical treatment of deep neural networks and energy models, that are the building blocks of many modern machine learning architectures. About neural networks we will study the basics of statistical learning theory, the back-propagation algorithm and stochastic gradient descent, the benefits of depth. About energy models we will cover some of the most used learning and sampling algorithms. In the exercise classes, besides solving theoretical problems, there will be some Python programming sessions to implement the models introduced in the lectures.
Probability Theory I \
Basic knowledge of Markov chains is useful for some part of the course.
Applied Mathematics
Elective
Mathematics
Concentration Module
Probability Theory II – Stochastic Processes
Lecturer: Angelika Rohde
Assistant: Johannes Brutsche
Language: in English
Lecture: Mo, Mi, 14-16h, HS II, Albertstr. 23b
Tutorial: 2 hours, date to be determined
A stochastic process \((X_t)_{t\in T}\) is a family of random variables, where mostly the situation \(T = \mathbb{N}\) or \(T = [0, 1]\) is studied. Basic examples include stationary time series, the Poisson process and Brownian motion as well as processes derived from those. The lecture includes ergodic theory and its applications, Brownian motion and especially the study of its path properties, the elegant concept of weak convergence on Polish spaces as well as functional limit theorems. Finally, we introduce stochastic integration with respect to local martingales, based on the continuous time version of the martingale transform.
Probability Theory I
Applied Mathematics
Elective
Mathematics
Concentration Module
Futures and Options
Lecturer: Eva Lütkebohmert-Holtz
Language: in English
This course covers an introduction to financial markets and products. Besides futures and standard put and call options of European and American type we also discuss interest-rate sensitive instruments such as swaps.
For the valuation of financial derivatives we first introduce financial models in discrete time as the Cox--Ross--Rubinstein model and explain basic principles of risk-neutral valuation. Finally, we will discuss the famous Black--Scholes model which represents a continuous time model for option pricing.
Elementary Probability Theory I
Applied Mathematics
Elective
Mathematics
Concentration Module
Markov Chains
Lecturer: David Criens
Language: in English
Lecture: Mi, 10-12h, SR 226, Hermann-Herder-Str. 10
Tutorial: 2 hours, date to be determined
The class of Markov chains is an important class of (discrete-time) stochastic processes that are used frequently to model for example the spread of infections, queuing systems or switches of economic scenarios. Their main characteristic is the Markov property, which roughly means that the future depends on the past only through the current state. In this lecture we provide the mathematical foundation of the theory of Markov chains. In particular, we learn about path properties, such as recurrence and transience, state classifications and discuss convergence to the equilibrium. We also study extensions to continuous time. On the way we discuss applications to biology, queuing systems and resource management. If the time allows, we also take a look at Markov chains with random transition probabilities, so-called random walks in random environment, which is a prominent model in the field of random media.
Required: Elementary Probability Theory I \
Recommended: Analysis III, Probability Theory I
Applied Mathematics
Elective
Mathematics
Concentration Module
Mathematical Introduction to Deep Neural Networks
Lecturer: Diyora Salimova
Assistant: Ilkhom Mukhammadiev
Language: in English
Lecture: Mi, 12-14h, SR 226, Hermann-Herder-Str. 10
Tutorial: 2 hours, date to be determined
The course will provide an introduction to deep learning algorithms with a focus on the mathematical understanding of the objects and methods used. Essential components of deep learning algorithms will be reviewed, including different neural network architectures and optimization algorithms. The course will cover theoretical aspects of deep learning algorithms, including their approximation capabilities, optimization theory, and error analysis.
Analysis I and II, Lineare Algebra I and II
Applied Mathematics
Elective
Mathematics
Concentration Module
Numerical Optimal Control
Lecturer: Moritz Diehl
Language: in English
Tutorial / flipped classroom: Di, 14-16h, HS II, Albertstr. 23b
Sit-in exam: date to be announced
The aim of the course is to give an introduction to numerical methods for the solution of optimal control problems in science and engineering. The focus is on both discrete time and continuous time optimal control in continuous state spaces. It is intended for a mixed audience of students from mathematics, engineering and computer science.
The course covers the following topics:
The lecture is accompanied by intensive weekly computer exercises offered both in MATLAB and Python (6~ECTS) and an optional project (3~ECTS). The project consists in the formulation and implementation of a self-chosen optimal control problem and numerical solution method, resulting in documented computer code, a project report, and a public presentation.
Required: Analysis I and II, Linear Algebra I and II \
Recommended: Numerics I, Ordinary Differential Equations, Numerical Optimization
Applied Mathematics
Elective
Mathematics
Concentration Module
Theory and Numerics for Partial Differential Equations – Selected Nonlinear Problems
Lecturer: Sören Bartels
Assistant: Tatjana Schreiber
Language: in English
Lecture: Mo, 12-14h, SR 226, Hermann-Herder-Str. 10
Tutorial: 2 hours, date to be determined
The lecture addresses the development and analysis of numerical methods for the approximation of certain nonlinear partial differential equations. The considered model problems include harmonic maps into spheres and total-variation regularized minimization problems. For each of the problems, a suitable finite element discretization is devised, its convergence is analyzed and iterative solution procedures are developed. The lecture is complemented by theoretical and practical lab tutorials in which the results are deepened and experimentally tested.
'Introduction to Theory and Numerics for PDEs' or 'Introduction to PDEs'
Applied Mathematics
Elective
Mathematics
Concentration Module