Module Handbook

International Master
"Scientic Computing"

Ruprecht-Karls-Universität Heidelberg

Fakultät für Mathematik und Informatik

Version as of 09.02.2022 corresponding to examination regulations of 22.04.2013

form of study: full time

type of study: consecutive

regular period of study: 4 semesters

number of credit points to gain in this study: 120

date of begin: 11.03.2009

location of study: Heidelberg

number of places: no limitation

fee: according to general regulations of Heidelberg University

1
Contents
1 Qualication objectives, prole, and particularities of the degree programme 4
1.1 Preamble - Qualication objectives of Heidelberg University . . . . . . . . . . . . . . 4
1.2 Prole of the degree programme . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.3 Subject-specic qualication objectives of the degree programme . . . . . . . . . . . 4
1.4 Generic qualication objectives of the degree programme . . . . . . . . . . . . . . . . 5
1.5 Graduates of the degree programme may enter any of the following professions . . . 5
1.6 Particularities of the degree programme and module descriptions . . . . . . . . . . . 5
1.6.1 Reason for cumulative examinations . . . . . . . . . . . . . . . . . . . . . . . 5
1.6.2 Reason for modules with fewer than 5 credits . . . . . . . . . . . . . . . . . . 5
1.6.3 Description of the teaching and learning forms . . . . . . . . . . . . . . . . . 6
1.6.4 Modalities for exams . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6

2 Model study plan and Mobility 7

2.1 Model study plan . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
2.2 Mobility window . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7

3 Core Courses in Computer Science 8

Advanced Machine Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9
Algorithm Engineering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
Algorithms and Data Structures 2 . . . . . . . . . . . . . . . . . . . . . . . . . . 12
Complex Network Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14
Computer Graphics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
Fundamentals of Machine Learning . . . . . . . . . . . . . . . . . . . . . . . . . . 17
Geometric Modeling and Animation . . . . . . . . . . . . . . . . . . . . . . . . . 18
Hardware Aware Scientic Computing . . . . . . . . . . . . . . . . . . . . . . . . 20
Machine Learning . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 22
Mining Massive Datasets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24
Object-Oriented Programming for Scientic Computing . . . . . . . . . . . . . . 26
Optimization for Machine Learning . . . . . . . . . . . . . . . . . . . . . . . . . . 27
Scientic Visualization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
Text Analytics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
Modules from the MSc Technische Informatik . . . . . . . . . . . . . . . . . . . . . 33

4 Other Courses in Computer Science 34

Computational Geometry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
Computerspiele . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 36
Praktische Geometrie . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
Randomisierte Algorithmen . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 38

5 Core Courses in Mathematics 40

Grundmodul Angewandte Analysis und Modellierung . . . . . . . . . . . . . . . . 41
Basic course Numerical Analysis and Optimization . . . . . . . . . . . . . . . . . 43

2
 Grundmodul Statistik und Wahrscheinlichkeitsrechnung . . . . . . . . . . . . . . 46
Aufbaumodul Angewandte Analysis und Modellierung . . . . . . . . . . . . . . . 48
Advanced course numerical analysis and optimization . . . . . . . . . . . . . . . 50
Aufbaumodul Statistik und Wahrscheinlichkeitsrechnung . . . . . . . . . . . . . . 53
Spezialisierungsmodul Angewandte Analysis und Modellierung . . . . . . . . . . 56
Special topics of numerical analysis and optimization . . . . . . . . . . . . . . . . 57
Spezialisierungsmodul Statistik und Wahrscheinlichkeitsrechnung . . . . . . . . . 58

6 General Modules 59
Seminar . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 60
Advanced Software Practical . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
Field of Application . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 62
Lab internship in eld of application . . . . . . . . . . . . . . . . . . . . . . . . . 63
Master Thesis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 64

7 Key Competence Program 65

Einführung in das Textsatzsystem LaTeX . . . . . . . . . . . . . . . . . . . . . . 66

3
1 Qualication objectives, prole, and
particularities of the degree programme
1.1 Preamble - Qualication objectives of Heidelberg University
In keeping with Heidelberg University's mission statement and constitution, degree programmes
are designed to provide a comprehensive academic education, incorporating subject-specic, cross-
disciplinary, and career-related objectives that prepare students for their future professional careers.
The resulting skills prole is a valid qualication prole that is included in the module handbooks
for all university disciplines and is implemented in each degree programme?s specic qualication
objectives, curricula, and modules:

ˆ Development of subject-specic skills, with a particular emphasis on research;

ˆ Development of the skills required for trans-disciplinary dialogue;

ˆ Development of practical problem-solving skills;

ˆ Development of personal and social skills;

ˆ Promotion of students' willingness to assume social responsibility on the basis of the skills
acquired.

1.2 Prole of the degree programme

The international master program "Scientic Computing" aims at expanding prociency in math-
ematics and computer science with a particular focus on the interplay of the two towards topics
relevant to cutting edge research at Heidelberg University.

1.3 Subject-specic qualication objectives of the degree

programme
Graduates of the master program are able to apply their in-depth knowledge in one or more areas of
Applied Mathematics and Computer Science such as machine learning and data analysis, numerical
modelling, simulation and optimization, or scientic visualization and computer graphics. They
are able to analyse and decompose complex real-world problems into manageable components and
develop mathematical and computational approaches for them.
Graduates are trained to select and eciently implement appropriate computational methods
of mathematics and computer science and, if necessary, independently tailor or advance them to
meet their needs. Graduates are competent in identifying the adequate computational resources to
simulate said models. They are able to transfer insights gained back to the original problem setting
and draw meaningful conclusions.

4
1.4 Generic qualication objectives of the degree programme
Graduates of the programme are expected to possess the following competencies of interdisciplinary
nature:

ˆ Graduates have acquired wide-ranging problem-solving skills, are procient in their application
and competent in applying them to new, unfamiliar situations.

ˆ They are competent in collecting independent information, to make judgments and to acquire
knowledge in their eld as well as from related disciplines. In particular, they are capable of
procuring and interpreting scientic literature and of evaluating alternative solutions in their
areas of specialization.

ˆ Graduates are able to communicate and present their results and conclusions orally and in
writing to experts and non-experts and to engage in disciplinary and interdisciplinary scientic
discussions.

ˆ They are able to deal eectively with complex problems and situations, possess decision-
making skills, and can independently carry out research- or application-oriented projects.

ˆ Graduates have the competence to work in disciplinary and interdisciplinary teams, to take
on team leadership and communicate eectively within the team.

ˆ They apply time-management and organizational skills condently.

1.5 Graduates of the degree programme may enter any of the

following professions
Graduates are well versed to enter any profession requiring advanced problem-solving, computa-
tional, and analytic skills. This includes careers in a wide range of disciplines in industry, academia
and the public sector, such as computational scientist, mathematical modeller, data scientist, com-
putational engineer, simulation specialist, software engineer, project manager in research and de-
velopment, academic researcher, scientic manager, and others.

1.6 Particularities of the degree programme and module

descriptions
1.6.1 Reason for cumulative examinations
Several modules in the degree programme are aiming to assess both practical skills as well as
acquired theoretical knowledge, which in some cases warrants cumulative assessments made up of
two or more components that are able to check all aspects.

1.6.2 Reason for modules with fewer than 5 credits

There are some modules in this programme with less than 5 credits. These modules are self-
contained units of study in terms of content which do not justify more credits and cannot reasonably
be combined with other modules.

5
1.6.3 Description of the teaching and learning forms
ˆ Lecture: Presentation of the course content by the lecturer using appropriate media; inter-
action and questions are possible.

ˆ Exercise: Exercises and smaller parts of the syllabus are explained; questions, interaction
and discussion by and with the students to understand the syllabus and the example exercises.

ˆ Seminar: Independent development of a scientic topic, preparation of a presentation, giv-

ing the presentation with subsequent questions and discussion of the participants about the
presentation, written elaboration of the content.

ˆ Practical: Project work on the basis of a programming task, independent development of

software including documentation, preparation of a project report and a lecture, giving a
lecture on the presentation of the software (20-30 minutes).

1.6.4 Modalities for exams

At the beginning of each course, the details and, in particular, deviations from the modalities for
exam listed below will be announced by the lecturer.

Many modules have a uniform regulation for the awarding of the CP, so this regulation is de-
scribed in detail here and then only referred to here in the module descriptions.

Rules for awarding the CP: In this module, the CP are awarded if the nal exam is passed. The
details of the nal exam are described in the individual module descriptions. In this module there
is a practice operation with the processing of exercises. In order to be admitted to the nal exam,
generally 50% of the points in the exercises should be achieved. The lecturer can deviate from this
in individual cases.

Examination scheme: This cell of the module description contains the number of attempts which
are allowed to pass the module according to the examination regulations. A passed exam cannot
be repeated.
1+1: after the rst attempt there is only one repetition possibility .
Examination period: Two examination periods were set for the written examinations at the
end of each semester. The rst examination period lasts three weeks and consists of the last week of
the lecture period and the rst two weeks of the lecture-free period. The second examination period
lasts three weeks and consists of the last three weeks of the lecture-free period. In exceptional cases,
examinations can take place outside of these examination periods.

Examination dates: For modules that are oered once a year or less frequently, two exami-
nation dates are always oered after the module. In the case of written exams, these are within the
examination periods mentioned above. In the case of oral exams, the dates are set by the lecturers.
For modules that are oered every semester, there is only one examination date after the module.
The students choose which of the oered examination dates they take.

If there are exceptions to the examination dates, especially if they are outside the
examination periods mentioned above, the lecturer must announce them at the begin-
ning of the course.

6
2 Model study plan and Mobility
2.1 Model study plan

1st year:
Compulsory optional modules in Mathematics 16 CP
Compulsory optional modules in Computer Science 16 CP
Field of Application 18 CP
2 Seminars 12 CP
sum 62 CP
2nd year:
Specialization modules 16 CP
Key Competence Program 6 CP
Seminar 6 CP
Master Thesis 30 CP
sum 58 CP
total: 120 CP

2.2 Mobility window

The master's program Scientic Computing oers a large variety of possibilities for student mobility
due to the strong international research collaboration of the scientists involved. Based on a solid
methodological education background, the third term of the program is particularly suitable for
spending a term abroad, but the study program also actively supports individual mobility concepts.
Students are advised to plan a mobility measure well in advance in cooperation with the counseling
oce of the program. Applications for support by the ERASMUS program and the 4EU+ alliance
take planning phase of up to 10 months.
Spending a term abroad opens up the possibility to learn about dierent research topics and
might well lead to a master thesis under the joint supervision of scientists from both the host and
the home university. Short-term mobilities such as the participation in summer schools or single
compact courses within the framework of the program are also encouraged and credits from such
activities can be recognized based on the regular recognition of external modules.

7
3 Core Courses in Computer Science
In this chapter all module descriptions for the modules in computer science are listed. At the end
there is a list of modules from the MSc Technische Informatik which are also allowed to choose as
modules in computer science.

For the compulsory optional modules in Computer Science 16 CP must be recieved.

8
Advanced Machine Learning

Code Name
IAML Advanced Machine Learning
CP Duration Oered
8 one semester follows *Fundamentals of
Machine Learning*
Format Workload Availability
Lecture 4 SWS 240h, thereof cannot be combined with
+ Exercise 60h lecture *Machine Learning*
course 2 SWS 90h tutorials, homework, lecture wrap-up M.Sc. Angewandte Informatik
90h graded nal report M.Sc. Data and Computer
Science
M.Sc. Scientic Computing
Language Lecturer(s) Examination scheme
English Ullrich Köthe 1+1
Learning Students get to know advanced machine learning methods that dene the
objectives state-of-the-art and major research directions in the eld. Students understand
when these methods are called for, what limitations of standard solutions they
address, and how they are applied to real-world problems.
In addition, students learn how to use Python-based machine learning software
such as scikit-learn, theano and OpenGM.
Learning The lecture, along with its sibling *Fundamentals of Machine Learning*, oers
content an extended version of the one-semester course *Machine Learning*:
Multi-layered architectures (neural networks, deep learning); directed and
undirected probabilistic graphical models (Gaussian processes, latent variable
models, Markov random elds, structured learning); feature optimization
(feature selection and learning, dictionary learning, kernel approximation,
randomization); weak supervision (one-class learning, multiple instance learning,
active learning, reinforcement learning)
Requirements recommended are: lecture *Fundamentals of Machine Learning* or similar
for
participation
Requirements The module is completed with a graded written exam. This exam is a report on
for the a 90 h mini-research project. The nal grade of the module is determined by the
assignment grade of the exam. The requirements for the assignment of credits follows the
of credits regulations in section modalities for exams. Details will be given by the lecturer.
and nal
grade
Useful David Barber: Bayesian Reasoning and Machine Learning, Cambridge
literature University Press, 2012
Christopher M. Bishop: Pattern Recognition and Machine Learning, Springer,
2006

9
Algorithm Engineering

Code Name
IAE Algorithm Engineering
CP Duration Oered
8 one semester every summer semester
Format Workload Availability
Lecture 4 SWS 240h; thereof M.Sc. Angewandte Informatik
+ Exercise 90h lectures and tutorials, M.Sc. Data and Computer
course 2 SWS 15h exam preparations, Science
135h lecture wrap-up and homework M.Sc. Scientic Computing
Language Lecturer(s) Examination scheme
English Christian Schulz 1+1
Learning Students obtain a systematic understanding of algorithmic questions and
objectives solution approaches in the area of algorithm engineering.
The students will be able to transfer the learned techniques onto similar
problems and be able to interpret and understand current research topics in the
area of algorithm engineering.
Given a real-world problem, students are able to select appropriate algorithms
to come up with and implement ecient solutions.
In particular, students know realistic machine models and applications,
algorithm design, implementation techniques, experimental methodology and
can interpret of measurements.
Learning The listed abilities will be learned by concrete examples. In particular, we will
content almost always cover the best practical and theoretical methods. This methods
often deviate a lot by the algorithms learned in the basic courses. To this end
the lecture covers FPT/Kernelization in practice (independent set, vertex cover,
(all) minimum cuts (NOI algorithm), clique cover, node ordering), multi-level
algorithms (graph partitioning, modularity clustering, dynamic clustering,
process mapping, spectral techniques, exact approaches), route planning
(contraction hierarchies, arc-ags, hub-label algorithm), dynamic graph
algorithms (single-source reachability, transitive closure, matching, minimum
cuts, graph generation).
Requirements recommended are:
for Einführung in die Praktische Informatik (IPI), Programmierkurs (IPK),
participation Algorithmen und Datenstrukturen (IAD), Mathematik für Informatiker 1 oder
Lineare Algebra 1 (MA4), Algorithms and Data Structures 2
Requirements The module is completed with a graded oral exam. The nal grade of the
for the module is determined by the grade of the exam. The requirements for the
assignment assignment of credits follows the regulations in section modalities for exams.
of credits
and nal
grade

10
Useful Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Cliord Stein:
literature Introduction to Algorithms, 3rd Edition. MIT Press 2009, ISBN
978-0-262-03384-8, pp. I-XIX, 1-1292
Jon M. Kleinberg, Éva Tardos: Algorithm design. Addison-Wesley 2006, ISBN
978-0-321-37291-8, pp. I-XXIII, 1-838
Stefan Näher: LEDA, a Platform for Combinatorial and Geometric Computing.
Handbook of Data Structures and Applications 2004

11
Algorithms and Data Structures 2

Code Name
IADS2 Algorithms and Data Structures 2
CP Duration Oered
8 one semester every winter semester
Format Workload Availability
Lecture 4 SWS 240h; thereof B.Sc. Angewandte Informatik
+ Exercise 90h lectures and tutorials, B.Sc. Informatik
course 2 SWS 15h exam preparations, M.Sc. Angewandte Informatik
135h lecture wrap-up and homework M.Sc. Scientic Computing
Language Lecturer(s) Examination scheme
English Christian Schulz 1+1
Learning Students:
objectives - understand fundamental theoretical and practical concepts of advanced
algorithms and data structures,
- get to know established methods and algorithms,
- are familiar with issues of ecient implementations,
- are able to identify/formulate algorithmic problems in/for dierent application
areas,
- are able to analyse new algorithms as well as analysing their running time, and
select appropriate algorithms for applications
- are able to apply algorithms and data structures to real-world problems, and
can objectively assess the quality of the results
Learning Introduction to Algorithm Engineering:
content - advanced data structures (ecient addressable priority queues, monotone
priority queues, external priority queues),
- advances graph algorithms (strongly connected components, shortest paths,
maximum ows / min s-t cuts, min-cost ows),
techniques to solve problems to optimality (branch-and-bound,
branch-and-reduce, dynamic
programming, integer linear programming as a modelling tool),
- introduction to randomized algorithms, greedy algorithms, approximation
algorithms, advanced string algorithms, geometric algorithms, external memory
algorithms
Requirements recommended are: Einführung in die Praktische Informatik (IPI),
for Programmierkurs (IPK), Algorithmen und Datenstrukturen (IAD), Mathematik
participation für Informatiker 1 (IMI1) oder Lineare Algebra 1 (MA4)
Requirements The module is completed with a graded oral exam. The nal grade of the
for the module is determined by the grade of the exam. The requirements for the
assignment assignment of credits follows the regulations in section modalities for exams.
of credits
and nal
grade

12
Useful Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Cliord Stein:
literature Introduction to Algorithms, 3rd Edition. MIT Press 2009, ISBN
978-0-262-03384-8, pp. I-XIX, 1-1292
Kurt Mehlhorn, Peter Sanders: Algorithms and Data Structures: The Basic
Toolbox. Springer 2008, ISBN 978-3-540-77977-3
Jon M. Kleinberg, Éva Tardos: Algorithm design. Addison-Wesley 2006, ISBN
978-0-321-37291-8, pp. I-XXIII, 1-838
Stefan Näher: LEDA, a Platform for Combinatorial and Geometric Computing.
Handbook of Data Structures and Applications 2004

13
Complex Network Analysis

Code Name
ICNA Complex Network Analysis
CP Duration Oered
8 one semester every 2nd wintersemester
Format Workload Availability
Lecture 4 SWS 240 h; thereof M.Sc. Angewandte Informatik
+ Exercise 90 h lecture M.Sc. Data and Computer
course 2 SWS 12 h preparation for exam Science
130 h self-study and working on M.Sc. Scientic Computing
assignments/projects (optionally in groups) B.Sc. Mathematik
Language Lecturer(s) Examination scheme
English Michael Gertz 1+1
Learning Students
objectives - can describe basic measures and characteristics of complex networks
- can implement and apply basic network analysis algorithms using
programming environments such as R or Python
- can describe dierent network models and can describe, compute, and analyze
characteristic parameters of these models
- know how to compute dierent complex network measures and how to
interpret these measures
- know dierent generative models for constructing complex networks, especially
scale-free networks
- know the fundamental methods for the detection of communities in networks
and the analysis of their evolution over time
- are familiar with basic concepts of network robustness
- understand the principles behind the spread of phenomena in complex networks
Learning - Graph theory and graph algorithms; basic network measures
content - Random networks and their characteristics (degree distribution, component
sizes, clustering coecient, network evolution), small world phenomena
- Scale-free property of networks, power-laws, hubs, universality
- Barabasi-Albert model, growth and preferential attachment, degree dynamics,
diameter and clustering coecient
- Evolving networks, Bianconi-Barabasi model, tness, Bose-Einstein
condensation
- Degree correlation, assortativity, degree correlations, structural cutos
- Network robustness, percolation theory, attack tolerance, cascading failures
- Communities, modularity, community detection and evolution
- Spreading phenomena, epidemic modeling, contact networks, immunization,
epidemic prediction
Requirements recommended are: Algorithmen und Datenstrukturen (IAD), Knowledge
for Discovery in Databases (IKDD), Lineare Algebra I (MA4)
participation

14
Requirements The module is completed with a graded written exam. The nal grade of the
for the module is determined by the grade of the exam. The requirements for the
assignment assignment of credits follows the regulations in section modalities for exams.
of credits
and nal
grade
Useful - Albert-Laszlo Barabasi: Network Science, Cambridge University Press, 2016.
literature - M.E.J. Newmann: Networks: An Introduction, Oxford University Press, 2010.

- Vito Latora, Vincenzo Nicosia, Giovanni Russo: Complex Networks -

Principles, Methods and Applications, Cambridge University Press, 2017.
- David Easley, Jon Kleinberg: Networks, Crowds, and Markets: Reasoning
About a Highly Connected World, Cambridge University Press, 2010.
- Stanley Wasserman, Katherine Faust: Social Network Analysis-Methods and
Applications, Cambridge University Press, 1994.

15
Computer Graphics

Code Name
ICG Computer Graphics
CP Duration Oered
8 one semester every 3rd semester
Format Workload Availability
Lecture 4 SWS 240 h; thereof cannot be combined with
+ Exercise 90 h on-campus program Computergraphik 1 and 2
course 2 SWS 15 h exam preparation (ICG1, ICG2)
135 h independent study and exercises B.Sc. Angewandte Informatik
(possibly in groups) B.Sc. Informatik
M.Sc. Angewandte Informatik
M.Sc. Scientic Computing
Language Lecturer(s) Examination scheme
English Filip Sadlo 1+1
Learning The students understand fundamental and advanced concepts of computer
objectives graphics. They understand the mathematical fundamentals, data structures,
and implementation aspects. They get to know raster graphics, geometric
transforms, color perception and color models, and basics of geometric modeling.
The students are able to apply these concepts to real-world problems using
existing software packages, and develop small programs using OpenGL 4.
Learning - Introduction
content - Perception and Color
- Raytracing
- Transformations
- Rasterization
- OpenGL
- Textures
- Spatial Data Structures
Requirements recommended are: Einführung in die Praktische Informatik (IPI),
for Programmierkurs (IPK), Algorithmen und Datenstrukturen (IAD)
participation
Requirements The module is completed with a graded written or oral exam. The nal grade of
for the the module is determined by the grade of the exam. The requirements for the
assignment assignment of credits follows the regulations in section modalities for exams.
of credits
and nal
grade
Useful P. Shirley, S. Marschner: Fundamentals of Computer Graphics, 3rd Edition, AK
literature Peters
OpenGL Specications(GL 4.5 + GLSL 4.50) http://www.opengl.org/registry/
Optional
A. S. Glassner: An Introduction to Ray Tracing, Academic Press
T. Akenine-Möller, E. Haines: Real-Time Rendering, AK Peters, 2008

16
Fundamentals of Machine Learning

Code Name
IFML Fundamentals of Machine Learning
CP Duration Oered
8 one semester in (irregular) alternation with
*Machine Learning*
Format Workload Availability
Lecture 4 SWS 240h, thereof cannot be combined with
+ Exercise 60h lecture *Machine Learning*
course 2 SWS 90h tutorials, homework, lecture wrap-up M.Sc. Angewandte Informatik
90h graded nal report M.Sc. Data and Computer
Science
M.Sc. Scientic Computing
Language Lecturer(s) Examination scheme
English Ullrich Köthe 1+1
Learning Students understand fundamental concepts of machine learning (features vs.
objectives response, unsupervised vs. supervised training, regression vs. classication etc.),
get to know established learning methods and algorithms, are able to apply them
to real-world problems, and can objectively assess the quality of the results.
In addition, students learn how to use Python-based machine learning software
such as scikit-learn.
Learning The lecture, along with its sibling *Advanced Machine Learning*, oers an
content extended version of the one-semester course *Machine Learning*, with more
room for regression methods, unsupervised learning and algorithmic details:
Classication (nearest neighbor rules, linear and quadratic discriminant analysis,
logistic regression, classical and randomized decision trees, support vector
machines, ensemble methods); regression (linear and non-linear least squares,
regularized and sparse regression, robust regression); unsupervised learning
(hierarchical clustering, k-means algorithm, Gaussian mixture models and
expectation maximization, principal component analysis, non-linear dimension
reduction); evaluation (risk minimization, model selection, cross-validation)
Requirements recommended are: solid knowledge of basic calculus, statistics, and linear algebra
for
participation
Requirements The module is completed with a graded written exam. This exam is a report on
for the a 90 h mini-research project. The nal grade of the module is determined by the
assignment grade of the exam. The requirements for the assignment of credits follows the
of credits regulations in section modalities for exams. Details will be given by the lecturer.
and nal
grade
Useful Trevor Hastie, Robert Tibshirani, Jerome Friedman: The Elements of Statistical
literature Learning (2nd edition), Springer, 2009

17
Geometric Modeling and Animation

Code Name
IGMA Geometric Modeling and Animation
CP Duration Oered
8 one semester every 3rd semester
Format Workload Availability
Lecture 4 SWS 240 h; thereof M.Sc. Angewandte Informatik
+ Exercise 2 90 h on-campus program M.Sc. Data and Computer
SWS 15 h exam preparation Science
135 h independent study and exercises M.Sc. Scientic Computing
(possibly in groups)
Language Lecturer(s) Examination scheme
English Filip Sadlo 1+1
Learning The students
objectives know the mathematical foundations of geometric modeling
know the mathematical and physical foundations of computer animation
know the algorithms and implementation aspects
are familiar with the basics of animated movies
are able to apply existing tools for geometric modeling and animation
Learning Introduction to curves
content Interpolating curves
Bézier curves
B-Splines
Rational curves
Introduction to surfaces
Tensor product surfaces
Transnite surfaces and extrusion
Subdivision
Subdivision surfaces
Animation and simulation
Rigid body kinematics
Particle systems
Mass-spring models
Cloth modeling
Numerical methods for dierential equations
Collision detection and handling
Fluid simulation and natural phenomena
Requirements recommended are: Einführung in die Praktische Informatik (IPI),
for Programmierkurs (IPK), Algorithmen und Datenstrukturen (IAD)
participation

18
Requirements The module is completed with a graded oral or written exam. The nal grade of
for the the module is determined by the grade of the exam. The requirements for the
assignment assignment of credits follows the regulations in section modalities for exams.
of credits
and nal
grade
Useful - Curves and Surfaces for CAGD ? A Practical Guide, G. Farin, Morgan
literature Kaufmann, 2002
- Computer Animation ? Algorithms and Techniques, R. Parent, Morgan
Kaufmann, 2002
- 3D Game Engine Design: A Practical Approach to Real-Time Computer
Graphics, D. Eberly, Morgan Kaufmann, 2000
- Graphische Datenverarbeitung I, J. Encarnacao, W. Straÿer, R. Klein, 4.
Auage, Oldenbourg 1996
- Advanced Animation and Rendering Techniques, A. Watt, M. Watt,
Addison-Wesley, 1992
- Grundlagen der geometrischen Datenverarbeitung, J. Hoschek, D. Lasser,
Teubner 1992
- Numerical Recipes ? The Art of Scientic Computing, W.H. Press, P.
Flannery, S.A. Teukolsky, W.T. Vetterling, Cambridge University Press, 1986

19
Hardware Aware Scientic Computing

Code Name
IHASC Hardware Aware Scientic Computing
CP Duration Oered
8 one semester irregular
Format Workload Availability
Lecture 4 SWS 240h;thereof M.Sc. Angewandte Informatik
+ Exercise 90h lecture M.Sc. Data and Computer
Course 2 SWS 15h preparation for exam Science
135h self-study and working on M.Sc. Scientic Computing
assignments/projects (optionally in groups)
Language Lecturer(s) Examination scheme
English Peter Bastian 1+1
Learning Students are familiar with dierent forms of parallelism in modern computer
objectives architectures. The can exploit this parallelism selecting an appropriate
programming model. They are familiar with modelling of parallelism and know
fundamental parallel algorithms from scientic computing.
Learning Parallel Computer Architecture
content - Pipelining and super-scalar processors, SIMD vectorisation
- Caches
- Multicore architectures
- GPUs
- Communication networks
Programming Models
- Shared memory programming with OpenMP and C++ threads
- OpenCL or Cuda
- Task-based programming
- Message-passing, MPI
Parallel Algorithms
- Speedup & scalability
- Rooine model
- Linear Algebra: Matrix-Vector, Matrix multiplication, solving dense
systems, solving sparse systems
- Iterative Solution of Linear Systems
- High-Performance Libraries
- Dierential equations
- Particle Methods
Requirements basic knowledge in computer architecture and numerical methods; good
for programming skills in C++
participation

20
Requirements The module is completed with a graded exam. The note of this exam gives the
for the note for this module. Details for this exam as well as the requirements for the
assignment assignment of credits will be given by the lecturer an the beginning of this
of credits course.
and nal
grade
Useful Frédéric Magoules, François-Xavier Roux, Guillaume Houzeaux: Parallel
literature Scientic Computing, Wiley, 2016, doi: 10.1002/9781118761687

21
Machine Learning

Code Name
IML Machine Learning
CP Duration Oered
8 one semester in (irregular) alternation with
*Fundamentals of Machine
Learning* + *Advanced
Machine Learning*
Format Workload Availability
Lecture 4 SWS Arbeitsaufwand: 240h, thereof cannot be combined with
+ Exercise 60h lecture *Fundamentals of Machine
course 2 SWS 90h tutorials, homework, lecture wrap-up Learning* or *Advanced
90h graded nal report Machine Learning*
M.Sc. Angewandte Informatik
M.Sc. Data and Computer
Science
M.Sc. Scientic Computing
Language Lecturer(s) Examination scheme
English Ullrich Köthe 1+1
Learning Students understand a broad range of machine learning concepts, get to know
objectives established and advanced learning methods and algorithms, are able to apply
them to real-world problems, and can objectively assess the quality of the
results.
In addition, students learn how to use Python-based machine learning software
such as scikit-learn.
Learning This lecture is a compact version of the two-semester course *Fundamentals of
content Machine Learning* + *Advanced Machine Learning*:
Classication (linear and quadratic discriminant analysis, neural networks,
linear and kernelized support vector machines, decision trees and random
forests), least squares and regularized regression, Gaussian processes,
unsupervised learning (density estimation, cluster analysis, Gaussian mixture
models and expectation maximization, principal component analysis, bilinear
decompositions), directed probabilistic graphical models, optimization for
machine learning, structured learning
Requirements recommended are: solid knowledge of basic calculus, statistics, and linear algebra
for
participation
Requirements The module is completed with a graded written exam. This exam is a report on
for the a 90 h mini-research project. The nal grade of the module is determined by the
assignment grade of the exam. The requirements for the assignment of credits follows the
of credits regulations in section modalities for exams. Details will be given by the lecturer.
and nal
grade

22
Useful Trevor Hastie, Robert Tibshirani, Jerome Friedman: The Elements of Statistical
literature Learning (2nd edition), Springer, 2009;
David Barber: Bayesian Reasoning and Machine Learning, Cambridge
University Press, 2012

23
Mining Massive Datasets

Code Name
IMMD Mining Massive Datasets
CP Duration Oered
6 one semester at least every 4th semester
Format Workload Availability
Lecture 2 SWS 180 h; thereof M.Sc. Angewandte Informatik
+ Exercise 60 h lecture M.Sc. Data and Computer
course 2 SWS 15 h preparation for exam Science
105 h self-study and working on assignments M.Sc. Scientic Computing
(optionally in groups)
Language Lecturer(s) Examination scheme
English Artur Andrzejak 1+1
Learning * Knowledge of selected approaches and programming paradigms of parallel
objectives data processing
* Knowledge how to use tools for parallel data processing (among others Apache
Hadoop and Spark)
* Familiarity with application domains of big data analysis
* Knowledge of methods of parallel pre-processing of data
* Knowledge of methods like classication, regression, clustering and their
parallel implementations
* Knowledge of scaling of parallel algorithms
Learning This module covers the following topics:
content * programming paradigms for parallel-distributed data processing, especially
Map-Reduce and Spark programming models
* usage of tools like Apache Spark, Hadoop, Pig, Hive, and possibly other
frameworks for parallel-distributed data processing
* application cases in parallel data analysis, for example clustering,
recommendation, search for similar objects, mining of data streams
* techniques for parallel pre-processing of data
* fundamentals of analysis techniques such as classification, regression,
clustering and evaluation of the results
* parallel algorithms for data analysis and their implementations
* theory and practice of scalability and tuning of frameworks
Requirements recommended are Knowledge of Java/Python and in elementary probability
for theory / statistics; module IBD can be taken as a complement / extension.
participation
Requirements The module is completed with a graded exam. This note of this exam gives the
for the note for this module. Details for this exam as well as the requirements for the
assignment assignment of credits will be given by the lecturer an the beginning of this
of credits course.
and nal
grade

24
Useful * Jure Leskovec, Anand Rajaraman, Jerey D. Ullman, Mining of Massive
literature Datasets, Cambridge University Press, Version 2.1 von 2014
(http://www.mmds.org/)
* Trevor Hastie, Robert Tibshirani, Jerome Fried-man, The Elements of
Statistical Learning: Data Mining, Inference, and Prediction, Springer, 2009
(http://statweb.stanford.edu/~tibs/ElemStatLearn/)
* Ron Bekkerman, Misha Bilenko, John Langford, Scaling Up Machine
Learning, Cambridge University Press, 2012
* Jiawei Han, Micheline Kamber, Jian Pei, Data Mining: Concepts and
Techniques, Morgan Kaufmann, (third edition), 2012
* Books from O'Reilly Data Science Starter Kit, 2014
(http://shop.oreilly.com/category/get/data-science-kit.do)

25
Object-Oriented Programming for Scientic Computing

Code Name
IOPSC Object-Oriented Programming for Scientic Computing
CP Duration Oered
6 one semester every summer semester
Format Workload Availability
Lecture 2 SWS 180 h; thereof B.Sc. Angewandte Informatik
+ Exercise on 60 h lecture B.Sc. Informatik
computer 2 105 h self-study and working on assignments M.Sc. Angewandte Informatik
SWS 15 h preparation for exam M.Sc. Scientic Computing
Language Lecturer(s) Examination scheme
English Ole Klein 1+1
Learning The students
objectives are procient in the programming language C++,
can assess the performance of dierent programming techniques,
know template programming techniques, and can use the Standard Template
Library (STL).
They can apply their new skills to solve selected problems of Scientic
Computing.
Learning This module deepens the skills in object-oriented programming obtained in the
content basic lecture Einführung in die Praktische Informatik (IPI) with special
emphasis on Scientic Computing:
Class concept
Dynamic memory allocation
Exception handling
Resource allocation and initialization
Constness
Static versus dynamic polymorphism
Traits and Policies
Standard Template Library
Template Metaprogramming
Parallel programming techniques
Requirements recommended are: Einführung in die Praktische Informatik (IPI), alternatively
for basic knowledge of an object-oriented programming language
participation
Requirements The module is completed with a graded written exam. The nal grade of the
for the module is determined by the grade of the exam. The lecture will give the
assignment requirements for the assignment of credits.
of credits
and nal
grade
Useful
literature

26
Optimization for Machine Learning

Code Name
IOML Optimization for Machine Learning
CP Duration Oered
8 one semester every winter semester
Format Workload Availability
Lecture 4 SWS 240 h; thereof M.Sc. Angewandte Informatik
+ Exercise 60 h lectures M.Sc. Data and Computer
course 2 SWS 30 h exercises Science
24 h preparation for exam M.Sc. Mathematik
126 h self-study and working on M.Sc. Scientic Computing
assignments/projects (optionally in groups)
Language Lecturer(s) Examination scheme
English Bogdan Savchynskyy 1+1
Learning The students
objectives - can analyze optimization methods for machine learning problems and estimate
the area of their potential application
- can competently apply existing algorithms and program packages for inference
and learning with graphical models and neural networks
- know typical optimization techniques for inference and learning with graphical
models and neural networks
- understand the basics of convex analysis, convex optimization, convex duality
theory, (integer) linear programs and their geometry
Learning The course presents various existing optimization techniques for such important
content machine learning tasks, as inference and learning for graphical models and neural
networks. In particular, it addresses such topics as combinatorial algorithms,
integer linear programs, scalable convex and non-convex optimization and
convex duality theory. Graphical models and neural networks play a role of
working examples along the course. The content of the course includes:
- Convex analysis and optimization: convex sets and functions, polyhedra,
(integer) linear programs, basic rst-order convex optimization methods and
their stochastic variants, LP and Lagrange relaxations
- Graphical Models: dynamic programming, sub-gradient and block-coordinate
ascent inference methods, min-cut/max-ow based inference, structured risk
minimization for graphical models
- neural networks: architectures, backpropagation algorithm, stochastic gradient
descent and its variants for training neural networks.
Requirements recommended are: linear algebra, analysis and any universal programming
for language (e.g. C/C++/Pascal/python)
participation

27
Requirements The module is completed with a graded oral exam. The nal grade of the
for the module is determined by the grade of the exam. The requirements for the
assignment assignment of credits follows the regulations in section modalities for exams.
of credits
and nal
grade
Useful will beannounced by the lecturer at the beginning of the course
literature

28
Scientic Visualization

Code Name
ISV Scientic Visualization
CP Duration Oered
8 one semester every 3rd semester
Format Workload Availability
Lecture 4 SWS 240 h; thereof M.Sc. Angewandte Informatik
+ Exercise 2 90 h on-campus program M.Sc. Data and Computer
SWS 15 h exam preparation Science
135 h independent study and exercises M.Sc. Scientic Computing
(possibly in groups)
Language Lecturer(s) Examination scheme
English Filip Sadlo 1+1
Learning The students understand fundamental and advanced concepts of scientic
objectives visualization. They understand the mathematical fundamentals, data structures,
and implementation aspects. They get to know schemes for interpolation and
integration, mapping for scalar, vector, and tensor elds, and derived
approaches. The students understand approaches for direct and indirect volume
rendering, feature extraction, and topology-based analysis. The students are
able to apply these concepts to real-world problems using existing software
packages, and develop small programs using visualization libraries.
Learning - Introduction
content - Visualization Process
- Data Sources and Representation
- Interpolation and Filtering
- Approaches for Visual Mapping
- Scalar Field Visualization: Advanced Techniques for Contour Extraction,
Classication, Texture-Based Volume Rendering, Volumetric Illumination,
Advanced Techniques for Volume Visualization, Pre-Integration, Cell Projection,
Feature Extraction
- Vector Field Visualization: Vector Calculus, Particle Tracing on Grids, Vector
Field Topology, Vortex Visualization, Feature Extraction, Feature Tracking
- Tensor Field Visualization: Glyphs, Hue-Balls and Lit-Tensors, Line-Based
Visualization, Tensor Field Topology, Feature Extraction
Requirements strongly recommended is: Computer Graphics (ICG)
for recommended are: Einführung in die Praktische Informatik (IPI),
participation Programmierkurs (IPK), Algorithmen und Datenstrukturen (IAD)
Requirements The module is completed with a graded oral or written exam. The nal grade of
for the the module is determined by the grade of the exam. The requirements for the
assignment assignment of credits follows the regulations in section modalities for exams.
of credits
and nal
grade

29
Useful C.D. Hansen, C.R. Johnson, The Visualization Handbook, 2005.
literature

30
Text Analytics

Code Name
ITA Text Analytics
CP Duration Oered
8 one semester every 2nd winter semester
Format Workload Availability
Lecture 4 SWS 240 h; thereof M.Sc. Angewandte Informatik
+ Exercise 90 h lecture M.Sc. Data and Computer
course 2 SWS 15 h preparation for exam Science
135 h self-study and working on M.Sc. Scientic Computing
assignments/projects (optionally in groups)
Language Lecturer(s) Examination scheme
English Michael Gertz 1+1
Learning Students
objectives - can implement and apply dierent text analytics methods using open source
NLP and machine learning frameworks
- can describe dierent document and text representation models and can
compute and analyze characteristic parameters of these models
- know how to determine, apply, and interpret use-case specic document
similarity measures and underlying ranking concepts
- know the concepts and techniques underlying dierent text classication and
clustering approaches
- know dierent models for phrase extraction and text summarization and are
able to apply respective models and concepts using NLP and machine learning
frameworks
- know the fundamental methods for the extraction of document outlines at
dierent levels of granularity
- are familiar with basic concepts of topic models and their application in
dierent text analytics tasks
- understand the principles of evaluating results of text analytics tasks
- know the theoretical background of machine learning methods at sucient
depths to be able to choose parameters and adapt an algorithm to a given text
analytics problem
- are aware of ethical issues arising from applying text analytics in dierent
domains

31
Learning - Text analytics in the context of Data Science
content - Open source text analytics, NLP, and machine learning frameworks
- Fundamentals of NLP pipeline components
- Document and text representation models
- Document and text similarity metrics
- Approaches, techniques and corpora for benchmarking text analytics tasks
- Traditional and recent text classication and clustering approaches
- Information extraction and topic detection approaches
- Fundamentals of keyword and phrase extraction
- Text summarization techniques
- Generating document and text outlines
- Ethical and legal aspects of text analytics methods
- Text Analytics project management
Requirements Recommended are: solid knowledge of basic calculus, statistics, and linear
for algebra; good Python programming skills
participation
Requirements The module is completed with a graded exam. The note of this exam gives the
for the note for this module. Details for this exam as well as the requirements for the
assignment assignment of credits will be given by the lecturer an the beginning of this
of credits course.
and nal
grade
Useful The following textbooks and texts are useful but not required.
literature - Dan Jurafsky and James H. Martin. Speech and Language Processing (3rd ed.
draft)
- Yoav Goldberg. A Primer on Neural Network Models for Natural Language
Processing (2015)
- Christopher D. Manning and Hinrich Schütze: Foundations of Statistical
Natural Language Processing, MIT Press. Cambridge, MA: May 1999.
Furthermore, during the course of this lecture, several papers covering topics
discussed in class will be provided.

32
Modules from the MSc Technische Informatik
Here is only a list of modules. For a detailed description of the modules see the module handbook
for the MSc Technische Informatik.

 Introduction to High Performance Computing

 GPU Computing
 Advanced Parallel Computing
 Accelerator Practice
 Robotics 1 - Kinematics, Dynamics and Motion Planning
 Robotics 2 - Simulation and Optimization in Robotics
 Biomechanics 1
 Robotics Practical for Computer Engineering Master

33
4 Other Courses in Computer Science
The modules listed in this chapter can also be chosen for computer science.

Attention: The course language is most likely german.

34
Computational Geometry

Code Name
ICGeo Computational Geometry
CP Duration Oered
8 one semester irregular
Format Workload Availability
Lecture 4 SWS 240 h; thereof M.Sc. Angewandte Informatik
+ Exercise 90 h lectures and tutorials M.Sc. Data and Computer
course 2 SWS 15 h preparation for exam Science
135 h self-study and working on M.Sc. Scientic Computing
assignments/projects (optionally in groups)
Language Lecturer(s) Examination scheme
English Susanne Krömker 1+1
Learning The students know the algorithms and data structures of geometric and
objectives topological data processing.
They can understand and implement sweep algorithms for nearest neighbors,
intersections of line segments and Voronoi diagrams, can construct alpha shapes
and beta skeletons from pointclouds, know template-based and data-driven
algorithms for the determination of isolines and isosurfaces, can work with
discrete vector elds on simplicial complexes and know about persistence of
topological invariants.
They master the associated data structures for ecient storage and further
processing and can calculate the complexity of the various algorithms.
Learning Basic concepts from geometry, graph theory and topology, sweep algorithms in
content visibility analysis and Voronoi diagrams, Delaunay triangulations, alpha shapes,
beta skeletons, isosurfaces, discrete Morse theory
Requirements recommended is: Algorithmen und Datenstrukturen (IAD)
for
participation
Requirements The module is completed with a graded oral exam. The nal grade of the
for the module is determined by the grade of the exam. The requirements for the
assignment assignment of credits follows the regulations in section modalities for exams.
of credits
and nal
grade
Useful Rolf Klein: Algorithmische Geometrie, Springer Verlag, 2005
literature Herbert Edelsbrunner: Geometry and Topology of Mesh Generation, Cambridge
University Press, 2001
Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars:
Computational Geometry - Algorithms and Applications, 3rd edition, Springer,
2008
current publications

35
Computerspiele

Code Name
ICS Computerspiele
CP Duration Oered
8 ein Semester jedes Sommersemester
Format Workload Availability
Vorlesung 3 240 h; davon M.Sc. Angewandte Informatik
SWS + Übung 75 h Präsenzstudium M.Sc. Data and Computer
3 SWS 15 h Prüfungsvorbereitung Science
150 h Selbststudium und Aufgabenbearbeitung M.Sc. Scientic Computing
(evtl. in Gruppen)
Language Lecturer(s) Examination scheme
Englisch Jürgen Hesser 1+1
Learning Die Studierenden
objectives lernen die Konzepte von der informatischen Sicht kennen, was Computerspiele
ausmacht und welche Herausforderungen damit verbunden sind. Sie lernen, wie
man gute und eziente Architekturkonzepte dafür entwickelt sowie wie man
typische Probleme aus Graphik, Kollisionserkennung, Animation/Physik,
Pfadplanung/KI umsetzt. Zudem lernen sie in den Übungen, wie man konkrete
Spiele entwickelt, so dass sie in der Lage sind, eigene Spieleengines zu realisieren.
Learning Überblick über die Einteilung von Computerspielen
content Architektur von Game Engines
Vorstellung von OGRE als einer open-source Game Engine
Graphik und Computerspiele: ein Überblick
Kollisionserkennungstechniken
Animationstechniken und Physik bei Computerspielen mit Fokus auf der open
source Bibliothek Bullet
Pfadplanung und KI
Requirements empfohlen sind: Einführung in die Praktische Informatik (IPI),
for Programmierkurs (IPK), Algorithmen und Datenstrukturen (IAD)
participation
Requirements Das Modul wird mit einer benoteten Klausur abgeschlossen. Die Modulendnote
for the wird durch die Note der Klausur festgelegt. Für die Vergabe der LP gilt die
assignment Regelung aus dem Kapitel Prüfungsmodalitäten.
of credits
and nal
grade
Useful Gregory et al: Game Engine Architecture
literature Ericson: Real-Time Collision Detection
Eberly: Game Physics
Millington: Articial Intelligence for Games

36
Praktische Geometrie

Code Name
IPGeo Praktische Geometrie
CP Duration Oered
4 ein Semester unregelmäÿig
Format Workload Availability
Vorlesung 2 120 h; davon M.Sc. Angewandte Informatik
SWS, Übung 1 45 h Präsenzstudium M.Sc. Data and Computer
SWS 60 h Aufgabenbearbeitung Science
15 h Prüfungsvorbereitung M.Sc. Scientic Computing
Language Lecturer(s) Examination scheme
Deutsch Susanne Krömker 1+1
Learning Verständnis grundlegender geometrischer Konzepte zur Datenanalyse sowie
objectives eektive Punktsuche und Weiterverarbeitung von Messdaten
Souveräner Umgang mit Projektionen und Beschreibungen jenseits der
dreidimensionalen Erfahrungswelt
Berechnung geometrischer Invarianten, Distanzen, Krümmungen aus Messdaten,
rekonstruierten und generierten Flächen
Learning Grundlegende Gebiete der Geometrie mit Relevanz in Computergraphik,
content Bildverarbeitung, Mustererkennung, Computer Vision und Geometrischem
Modellieren
(i) Analytische Geometrie: Operationen auf Vektorräumen mit geeigneten
Koordinaten und Abbildungen (Anitäten, Kollinearitäten), geometrische
Ausgleichsprobleme aus fehlerbehafteten Messdaten
(ii) Projektive Geometrie: Zentralprojektion und inverse Rekonstruktion von
3D-Objekten aus ebenen Bildern (Computer Vision, Geodäsie), Unterschiede
zwischen B-Spline-Kurven und -Flächen und der Klasse der NURBS,
Freiformgeometrien in CAD-Systemen
(iii) Dierentialgeometrie: Parameterdarstellungen in der geometrischen
Datenverarbeitung, implizite Darstellungen (level sets), Abschätzung von
Invarianten aus diskreten Daten (Triangulierungen, Punktwolken)
Requirements empfohlen sind: Einführung in die Praktische Informatik (IPI), Mathematik für
for Informatiker (IMI1 und 2) oder Lineare Algebra (MA4)
participation
Requirements Das Modul wird mit einer benoteten mündlichen Prüfung abgeschlossen. Die
for the Modulendnote wird durch die Note der Prüfung festgelegt. Für die Vergabe der
assignment LP gilt die Regelung aus dem Kapitel Prüfungsmodalitäten.
of credits
and nal
grade
Useful Geometrie für Informatiker, Skript TU Wien 2004, Helmut Pottmann
literature Aktuelle Fachveröentlichungen

37
Randomisierte Algorithmen

Code Name
IRA Randomisierte Algorithmen
CP Duration Oered
6 ein Semester mindst. jedes 4. Semester
Format Workload Availability
Vorlesung 3 180 h; davon B.Sc. Angewandte Informatik
SW + Übung 60 h Präsenzstudium B.Sc. Informatik
1 SWS 40 h Prüfungsvorbereitung M.Sc. Angewandte Informatik
80 h Selbststudium und Bearbeitung der M.Sc. Scientic Computing
Übungsaufgaben (eventuell in Gruppen)
Language Lecturer(s) Examination scheme
Deutsch Wolfgang Merkle 1+1
Learning Auf der Grundlage der behandelten Anwendungsbeispiele aus verschiedenen
objectives Teilgebieten der Informatik können die Studierenden die probabilistische
Betrachtungs- und Vorgehensweise anwenden
bei der Konstruktion und Analyse von probabilistischen und deterministischen
Algorithmen,
auf kombinatorische Fragestellungen,
um spieltheoretische Situationen zu analysieren,
auf kryptographische Fragestellungen.
Learning Elementare Wahrscheinlichkeitsrechnung
content Das Tenure-Spiel
Derandomisierungstechniken
Die probabilistische Methode
Byzantinische Übereinkunft
Stabile Heiraten und der Gale-Shapley-Algorithmus
Das Minimax-Prinzip von Yao
Komplexitätsanalyse des randomisierten Sortierens
Randomisierte Fehlersuche und -korrektur
Das Local-Lemma von Lovasz
PAC-Lernen und VC-Dimension
Wahrscheinlichkeitsverstärkung und Fehlerschranken
Lokale Suche für k-SAT
Kryptographische Protokolle
Requirements empfohlen sind: elementare Grundkenntnisse in Algorithmen wie sie z.B. im
for Modul Algorithmen und Datenstrukturen (IAD) vermittelt werden.
participation
Requirements Das Modul wird mit einer benoteten mündlichen oder schriftlichen Prüfung
for the abgeschlossen. Die Modulendnote wird durch die Note der Prüfung festgelegt.
assignment Für die Vergabe der LP gilt die Regelung aus dem Kapitel Prüfungsmodalitäten.
of credits
and nal
grade

38
Useful R. Motwani und P. Raghavan, Randomized Algorithms, Cambridge University
literature Press 1995.
M. Mitzenmacher und E. Upfal, Probability and Computing, Cambridge
University Press, 1995.
N. Alon und J. H. Spencer, The Probabilistic Method,
John Wiley and Sons, 2008.

39
5 Core Courses in Mathematics
In this chapter all module descriptions for the modules in mathematics are listed. In each module
several courses can be attended.

For the compulsory optional modules in Mathematics 16 CP must be recieved.

The english translation of these descriptions is in progress.

Attention: The course language can be english or german.

40
Grundmodul Angewandte Analysis und Modellierung

Code Name
MM12 Grundmodul Angewandte Analysis und Modellierung
CP Duration Oered
8 pro pro Veranstaltung: ein Semester mindestens jährlich
Veranstaltung
Format Workload Availability
pro pro Veranstaltung: Es können mehrere verschiedene
Veranstaltung: 240 h; davon Veranstaltungen in diesem
Vorlesung 4 60 h Präsenz in der Vorlesung Modul absolviert werden.
SWS + Übung 30 h Präsenz in Übungen M.Sc. Mathematik,
2 SWS 120 h Hausaufgaben und selbständiges M.Sc. Scientic Computing
Nacharbeiten
30 h Prüfungsvorbereitung
Language Lecturer(s) Examination scheme
Deutsch oder wechselnd
Englisch
Learning Verständnis der grundlegenden Strukturen, Sätze und Methoden eines
objectives Forschungsgebietes der Mathematik,
Fähigkeit, typische Aussagen mit den erlernten Methoden selbständig zu
beweisen, eigene Kenntnislücken zu erkennen und selbständig zu schlieÿen,
Selbstbewusster Umgang mit Lernstrategien und mathematischem Denken

41
Learning In diesem Modul werden folgende Veranstaltungen angeboten:
content
Elliptische partielle Dierentialgleichungen:
Existenz von Lösungen linearer elliptischer Dierentialgleichungen, Höhere
Regularität in Sobolevräumen, Cacciopoli-Leray Ungleichung, Schaudertheorie,
Campanatoräume, BMO, L^p-Theorie elliptischer Dierentialgleichungen,
Harmonischen Abbildungen.

Evolutionsgleichungen:
Bochner Integral, Aubin-Lions Lemma, Galerkinverfahren, Schwache Lösung für
Parabolische Dierentialgleichungen, Hyperbolische Dierentialgleichungen,
Navier Stokes Gleichung, Euler-Gleichung, Beispiele weitere nichtlineare
Dierentialgleichungen

Nichtlineare Funktionalanalysis:
Fixpunktsatz von Schauder, Theorie des Abbildungsgrades, Lemma von Sard,
Theorie monotoner Operatoren, Anwendungen auf partielle
Dierentialgleichungen, Bifurkationstheorie, Hopf-Bifurkation

Variationsrechnung und Modellierung:

Variationsrechnung in mehreren Variablen, Motivierung aus Systemen der
Natur, Direkte Methode, Euler-Lagrange Gleichung, Null-Lagrangians,
Konvexitätsbegrie, Gamma-Konvergenz, Homogenisierung, Gradientenüsse
Requirements empfohlen sind: Kenntnisse der Analysis, linearen Algebra, Numerik und
for Funktionalanalysis
participation
Requirements Jede Veranstaltung wird mit einer benoteten mündlichen oder schriftlichen
for the Prüfung abgeschlossen. Weitere Details werden von der bzw. dem Lehrenden zu
assignment Beginn der Veranstaltung bekannt gegeben.
of credits
and nal
grade
Useful wird im LSF oder auf der Homepage der Vorlesung angegeben
literature

42
Basic course Numerical Analysis and Optimization

Code Name
MM15 Basic course Numerical Analysis and Optimization
CP Duration Oered
8 pro pro Veranstaltung: ein Semester mindestens jährlich
Veranstaltung
Format Workload Availability
pro pro Veranstaltung: Es können mehrere verschiedene
Veranstaltung: 240 h; davon Veranstaltungen in diesem
Vorlesung 4 60 h Präsenz in der Vorlesung Modul absolviert werden.
SWS + Übung 30 h Präsenz in Übungen M.Sc. Mathematik,
2 SWS 120 h Hausaufgaben und selbständiges M.Sc. Scientic Computing
Nacharbeiten
30 h Prüfungsvorbereitung
Language Lecturer(s) Examination scheme
Deutsch oder wechselnd
Englisch
Learning Verständnis der grundlegenden Strukturen, Sätze und Methoden eines
objectives Forschungsgebietes der Mathematik,
Fähigkeit, typische Aussagen mit den erlernten Methoden selbständig zu
beweisen, eigene Kenntnislücken zu erkennen und selbständig zu schlieÿen,
Selbstbewusster Umgang mit Lernstrategien und mathematischem Denken

43
Learning In diesem Modul werden folgende Veranstaltungen angeboten:
content
Finite Elemente:
Überblick über die Theorie schwacher Lösungen elliptischer
Dierentialgleichungen, Galerkinapproximation von Variationsproblemen,
Aufbau der Methode der niten Elemente, das Bramble-Hilbert-Lemma, a priori
und a posteriori Fehleranalyse, Lösung der diskreten Probleme,
Mehrgitterverfahren, Aspekte der Implementation, adaptive Gitterverfeinerung,
Einführung in parabolische Gleichungen

Nichtlineare Optimierung:
Endlich-dimensionale, glatte, kontinuierliche, nichtlineare Opti-
mierungsprobleme, Optimalitäsbedingungen für unbeschränkte und beschränkte
Optimierungsprobleme, Gradientenverfahren, Konjugierte
Gradienten-(CG-)Verfahren, Line Search, Newton- und
Quasi-Newton-SQP-Verfahren, Gauÿ-Newton-Verfahren, Behandlung von
Ungleichungsbeschränkungen, Trust-Region- Verfahren, Automatische
Dierentiation

Numerische Optimierung bei Dierentialgleichungen I:

Modellierung dynamischer Prozesse, Parameterschätzung
(Einfachschieÿverfahren, Mehrzielmethode, Kollokation, Verallgemeinertes
Gauÿ-Newton, Strukturausnutzende Lösung der linearisierten Subprobleme,
Konvergenzeigenschaften), Optimalsteuerungsproblem (Problemformulierung,
Direkte Methode zur Lösung von Optimalsteuerungsproblemen,
Mehrzielmethode, SQP-Verfahren, Strukturausnutzende SQP-Verfahren für das
diskretisierte Optimalsteuerungsproblem)

Uncertainty Quantication 1:
Im Rahmen dieser Veranstaltung werden methodische Ansätze vermittelt, die es
ermöglichen, eine Quantizierung der Unsicherheit im Zusammenhang mit
komplexen numerischen Modellen zu gewinnen. Folgende Schwerpunkte werden
behandelt: Rundungsfehler und Fehlerfortpanzung in der Numerik, Kondition
eines Problems; Stabilitätskonzepte, Monte-Carlo Methoden und
Kollokationsverfahren, Polynomielle Chaosentwicklungen, Stochastische
Galerkin Diskretisierung
Requirements empfohlen sind: Kenntnisse der Analysis, linearen Algebra und Numerik.
for
participation

44
Requirements Jede Veranstaltung wird mit einer benoteten mündlichen oder schriftlichen
for the Prüfung abgeschlossen. Weitere Details werden von der bzw. dem Lehrenden zu
assignment Beginn der Veranstaltung bekannt gegeben.
of credits
and nal
grade
Useful wird im LSF oder auf der Homepage der Vorlesung angegeben
literature

45
Grundmodul Statistik und Wahrscheinlichkeitsrechnung

Code Name
MM16 Grundmodul Statistik und Wahrscheinlichkeitsrechnung
CP Duration Oered
8 pro pro Veranstaltung: ein Semester mindestens jährlich
Veranstaltung
Format Workload Availability
Lecture 4 SWS pro Veranstaltung: Es können mehrere verschiedene
+ Tutorial 2 240 h; davon Veranstaltungen in diesem
SWS 60 h Präsenz in der Vorlesung Modul absolviert werden.
30 h Präsenz in Übungen M.Sc. Mathematik,
120 h Hausaufgaben und selbständiges M.Sc. Scientic Computing
Nacharbeiten
30 h Prüfungsvorbereitung
Language Lecturer(s) Examination scheme
Deutsch oder wechselnd
Englisch
Learning Verständnis der grundlegenden Strukturen, Sätze und angewandten und
objectives theoretischen Methoden der Wahrscheinlichkeitstheorie und/oder Statistik,
Fähigkeit, theoretische Aussagen mit den erlernten Methoden selbständig zu
beweisen und die Kenntnisse in praktischen Kontexten anzuwenden
Learning In diesem Modul werden folgende Veranstaltungen angeboten:
content
Wahrscheinlichkeitstheorie II:
Theorie stochastischer Prozesse (Endlich-dimensionale Verteilungen,
Existenzsatz von Kolmogorov, stetige Pfade, Konstruktion und Eigenschaften
der Brownschen Bewegung, Gauÿprozesse); Ergodentheorie (Stationäre und
ergodische Prozesse, Ergodensätze); Invarianzprinzipien (Straheit, schwache
Konvergenz im Raum der stetigen Funktionen, Invarianzprinzip von Donsker,
Theorie der empirischen Prozesse); stochastisches Integral (Martingale in
stetiger Zeit, Itô-Integral, Itô-Formel)

Statistik II:
Asymptotische Statistik (asymptotische Normalität, Ezienz, Abstandsmaÿe,
Modell-Fehlspezikation, Tests von Hypothesen);
Nichtparametrische Statistik (Nichtparametrische Schätzer, Regularisierung,
Konvergenzraten, Kernschätzer, Adaptivität, nichtparametrische Tests);
Statistik für komplexe Systeme (z.B. Statistik stochastischer Prozesse, inverse
Probleme, hochdimensionale Statistik, Statistik bei Netzwerken)
Requirements empfohlen sind Kenntnisse der Analysis und linearen Algebra,
for Wahrscheinlichkeitstheorie 1 und Statistik 1
participation

46
Requirements Jede Veranstaltung wird mit einer benoteten mündlichen oder schriftlichen
for the Prüfung abgeschlossen. Weitere Details werden von der bzw. dem Lehrenden zu
assignment Beginn der Veranstaltung bekannt gegeben.
of credits
and nal
grade
Useful wird im LSF oder auf der Homepage der Vorlesung angegeben
literature

47
Aufbaumodul Angewandte Analysis und Modellierung

Code Name
MM22 Aufbaumodul Angewandte Analysis und Modellierung
CP Duration Oered
8 pro pro Veranstaltung: ein Semester mindestens jährlich
Veranstaltung
Format Workload Availability
pro pro Veranstaltung: Es können mehrere verschiedene
Veranstaltung: 240 h; davon Veranstaltungen in diesem
Vorlesung 4 60 h Präsenz in der Vorlesung Modul absolviert werden.
SWS + Übung 30 h Präsenz in Übungen M.Sc. Mathematik
2 SWS 120 h Hausaufgaben und selbständiges M.Sc. Scientic Computing
Nacharbeiten
30 h Prüfungsvorbereitung
Language Lecturer(s) Examination scheme
Deutsch oder wechselnd
Englisch
Learning Vertieftes Verständnis der Strukturen, Sätze, Beweise und Methoden eines
objectives engeren Forschungsgebietes der Mathematik,
Fähigkeit, Aussagen aus dem Teilgebiet selbständig zu beweisen und
Beweistechniken zu diskutieren, sowie Aufgaben auf ihre Charakteristika hin zu
analysieren und zu klassizieren um geeignete Lösungsmethoden zu wählen,
Fähigkeit, sich Teilaspekte des Themengebietes selbständig zu erarbeiten.
Learning In diesem Modul werden folgende Veranstaltungen angeboten:
content
Mathematische Grundlagen der Fluid Dynamik:
Physikalische Motivation der Navier-Stokes Gleichung, Spezielle Lösungen,
Kurzzeitexistenz schwacher Lösung, Langzeitexistenz schwacher Lösungen,
Vortizität, Navier-Stokes Gleichung in zwei Dimensionen, Existenz von
Lösungen der Eulergleichung

PDGs und Modellierung:

Modellierung physikalischer/biologischer Prozesse (z.B. Fluiddynamik,
Materialwissenschaften, Biologie, ...), Grundlegende mathematische Theorie
Requirements Grundmodul Angewandte Analysis und Modellierung
for
participation

48
Requirements Jede Veranstaltung wird mit einer benoteten mündlichen oder schriftlichen
for the Prüfung abgeschlossen. Weitere Details werden von der bzw. dem Lehrenden zu
assignment Beginn der Veranstaltung bekannt gegeben.
of credits
and nal
grade
Useful wird im LSF oder auf der Homepage der Vorlesung angegeben
literature

49
Advanced course numerical analysis and optimization

Code Name
MM25 Advanced course numerical analysis and optimization
CP Duration Oered
8 pro pro Veranstalung: ein Semester mindestens jährlich
Veranstaltung
Format Workload Availability
pro pro Veranstaltung: Es können mehrere verschiedene
Veranstaltung: 240 h; davon Veranstaltungen in diesem
Vorlesung 4 60 h Präsenz in der Vorlesung Modul absolviert werden.
SWS + Übung 30 h Präsenz in Übungen M.Sc. Mathematik
2 SWS 120 h Hausaufgaben und selbständiges M.Sc. Scientic Computing
Nacharbeiten
30 h Prüfungsvorbereitung
Language Lecturer(s) Examination scheme
Deutsch oder wechselnd
Englisch
Learning Vertieftes Verständnis der Strukturen, Sätze, Beweise und Methoden eines
objectives engeren Forschungsgebietes der Mathematik,
Fähigkeit, Aussagen aus dem Teilgebiet selbständig zu beweisen und
Beweistechniken zu diskutieren, sowie Aufgaben auf ihre Charakteristika hin zu
analysieren und zu klassizieren um geeignete Lösungsmethoden zu wählen,
Fähigkeit, sich Teilaspekte des Themengebietes selbständig zu erarbeiten.

50
Learning In diesem Modul werden folgende Veranstaltungen angeboten:
content * Gemischte Finite Elemente:
Stokes- und Navier-Stokes-Gleichungen, Sattelpunktprobleme, das closed range
theorem und inf-sub-Stabilität, Taylor-Hood- Elemente, Darcy-Gleichungen für
Strömung durch poröse Medien, nite element exterior calculus, discontinuous
Galerkin methods
* Parallele Löser für Finite Elemente:
abstrakte Unterraumkorrekturverfahren, überlappende Schwarz-Verfahren,
geometrische und algebraische Mehrgitter- verfahren, nichtüberlappende
Gebietszerlegungsverfahren, Konvergenztheorie der
Unterraumkorrekturverfahren, Implementation und parallele Skalierbarkeit
* Numerische Optimierung bei Dierentialgleichungen II:
Parameterschätzung mit Beschränkungen und Konvergenzanalyse für
Verallgemeinerte (beschränkte) Gauÿ-Newton-Verfahren, Statistische
Sensitivitätsanalyse (Vertrauens-/ Kondenzgebiete, Kovarianz-Analyse),
optimale Versuchsplanung (Problemformulierung, Sequentielle Versuchsplanung,
Numerische Lösung mit SQP-Verfahren, eziente Ableitungsberechnung),
Globalisierung der Konvergenz bei Newton-Verfahren für sehr nichtlineare
Probleme (Abstiegsstrategien, Natürliche Niveaufunktionen, Restriktiver
Monotonie-Test (RMT) und praktische Realisierung), Fortsetzungsmethoden
(Allgemeine Strategie, Verfahren höherer Ordnung, Schrittweitensteuerung),
Eziente Ableitungsberechnung (Vorwärts- und Rückwärtsmodus, Anwendung
auf gewöhnliche Dierentialgleichungen und Diskretisierungs-Verfahren dafür)
* Uncertainty Quantication 2:
Im Rahmen dieser Veranstaltung werden methodische Ansätze vermittelt, die
die Quantizierung von Unsicherheiten im Zusammenhang mit
Dierentialgleichungen ermöglichen. Folgende Schwerpunkte werden u.a.
behandelt: Karhunen-Loève Expansion, Kollokation bzw. hochdimensionale
Quadratur und Interpolation, Dünne Gitter, Stochastische Galerkin
Diskretisierung für partielle Dierentialgleichungen, Bayessche Formulierung
inverser Probleme
* Informationsgeometrie und Maschinelles Lernen:
- Dierentialgeometrie: Mannigfaltigkeiten, Untermannigfaltig- keiten, Vektor-,
Kovektor- und Tensorfelder, Riemannsche Metriken, ane Zusammenhänge,
Geodäten, Krümmungstensor)
- Informationsgeometrie: Maÿe auf endlichen Mengen, Fisher-Rao Metrik,
alpha-Zusammenhänge, Divergenzfunktionen, Informationsprojektionen,
graphische Modelle, Exponentialfamilie, statistische Mannigfaltigkeiten
- Maschinelles Lernen: ausgewählte Probleme der Inferenz, des überwachten und
unbewachten Lernens als Anwendungsbeispiele
Requirements empfohlen ist: Grundmodul Numerik und Optimierung
for
participation

51
Requirements Jede Veranstaltung wird mit einer benoteten mündlichen oder schriftlichen
for the Prüfung abgeschlossen. Weitere Details werden von der bzw. dem Lehrenden zu
assignment Beginn der Veranstaltung bekannt gegeben.
of credits
and nal
grade
Useful wird im LSF oder auf der Homepage der Vorlesung angegeben
literature

52
Aufbaumodul Statistik und Wahrscheinlichkeitsrechnung

Code Name
MM26 Aufbaumodul Statistik und Wahrscheinlichkeitsrechnung
CP Duration Oered
8 pro pro Veranstaltung: ein Semester mindestens jährlich
Veranstaltung
Format Workload Availability
pro pro Veranstaltung: Es können mehrere verschiedene
Veranstaltung: 240 h; davon Veranstaltungen in diesem
Vorlesung 4 60 h Präsenz in der Vorlesung Modul absolviert werden.
SWS + Übung 30 h Präsenz in Übungen M.Sc. Mathematik
2 SWS 120 h Hausaufgaben und selbständiges M.Sc. Scientic Computing
Nacharbeiten
30 h Prüfungsvorbereitung
Language Lecturer(s) Examination scheme
Deutsch oder wechselnd
Englisch
Learning Vertieftes Verständnis der grundlegenden Strukturen, Sätze und angewandten
objectives und theoretischen Methoden der Wahrscheinlichkeitstheorie und/oder Statistik,
Fähigkeit, theoretisch zu argumentieren, neue Aussagen mit den erlernten
Methoden selbständig zu beweisen und das Potential der Methoden in
praktischen Kontexten zu erkennen

53
Learning In diesem Modul werden folgende Veranstaltungen angeboten:
content
1. Fortgeschrittene Zeitreihenanalyse
2. Statistik zeitstetiger Prozesse
3. Angewandte Statistik

4. Lokale asymptotische Normalität und Semiparametrik:

Asymptotische Entscheidungstheorie für lokal asymptotisch normale
Experimente, Dierenzierbarkeit im quadratischen Mittel, Kontiguität,
Semiparametrik, asymptotische Ezienz in semiparametrischen Modellen

5. Empirische Prozesse:
Glivenko-Cantelli Sätze, Vapnik-Cervonenskis Theorie,
Konzentrationsungleichungen für empirische Prozesse, Donsker Theoreme,
Entropieabschätzungen für Funktionenklassen, Konvergenzraten in der
Nichtparametrik

6. Nichtparametrische Minimaxtheorie

7. Statistik inverser Probleme:

Lineare schlecht-gestellte inverse Probleme, spektrale Regularisierungsverfahren,
Projektionsverfahren, linearer Galerkinansatz, nicht-parametrische
Kurvenschätzung, Orakel-Optimalität, Minimax Theorie, Datengetriebene
Schätzverfahren, Gauÿ'sche inverse Regression, Dekonvolution, funktionale
lineare Regression, nicht-parametrische instrumentale Regression

8. Bayesstatistik
9. Hoch-dimensionale Statistik:
Hoch-dimensionale lineare Modelle, Schätzverfahren in hoch-dimensionalen
linearen Modellen, insbesonders LASSO-Schätzer, Kondenzbereiche und
Testverfahren in hoch-dimensionalen linearen Modellen, Modellwahlverfahren,
Kleinste Quadrate Schätzer mit Komplexitätsstraftermen,
Klassikationsverfahren
Requirements empfohlen ist eine Veranstaltung des Grundmoduls Statistik und
for Wahrscheinlichkeitsrechnung
participation

54
Requirements Jede Veranstaltung wird mit einer benoteten mündlichen oder schriftlichen
for the Prüfung abgeschlossen. Weitere Details werden von der bzw. dem Lehrenden zu
assignment Beginn der Veranstaltung bekannt gegeben.
of credits
and nal
grade
Useful wird im LSF oder auf der Homepage der Vorlesung angegeben
literature

55
Spezialisierungsmodul Angewandte Analysis und Modellierung

Code Name
MM32 Spezialisierungsmodul Angewandte Analysis und Modellierung
CP Duration Oered
pro Veranstaltung: ein Semester mindestens jährlich
Format Workload Availability
Es können mehrere verschiedene
Veranstaltungen in diesem
Modul absolviert werden.
M.Sc. Mathematik
M.Sc. Scientic Computing
Language Lecturer(s) Examination scheme
Deutsch oder wechselnd
Englisch
Learning Umfassende Kenntnisse und Verständnis der Strukturen, Aussagen, Methoden
objectives und Beweistechniken eines aktuellen Forschungsthemas der Mathematik,
Fähigkeit, sich komplexe mathematische Sachverhalte selbst zu erarbeiten und
zu diskutieren.
Learning Aktuelle Forschungsthemen aus den Arbeitsgebieten der Dozierenden.
content
Requirements empfohlen sind Veranstaltung(en) aus dem Aufbaumodul Analysis und
for Modellierung
participation
Requirements Jede Veranstaltung wird mit einer benoteten mündlichen oder schriftlichen
for the Prüfung abgeschlossen. Weitere Details werden von der bzw. dem Lehrenden zu
assignment Beginn der Veranstaltung bekannt gegeben.
of credits
and nal
grade
Useful wird im LSF oder auf der Homepage der Vorlesung angegeben
literature

56
Special topics of numerical analysis and optimization

Code Name
MM35 Special topics of numerical analysis and optimization
CP Duration Oered
pro Veranstaltung: ein Semester mindestens jährlich
Format Workload Availability
Es können mehrere verschiedene
Veranstaltungen in diesem
Modul absolviert werden.
M.Sc. Mathematik
M.Sc. Scientic Computing
Language Lecturer(s) Examination scheme
Deutsch oder wechselnd
Englisch
Learning Umfassende Kenntnisse und Verständnis der Strukturen, Aussagen, Methoden
objectives und Beweistechniken eines aktuellen Forschungsthemas der Mathematik,
Fähigkeit, sich komplexe mathematische Sachverhalte selbst zu erarbeiten und
zu diskutieren.
Learning Aktuelle Forschungsthemen aus den Arbeitsgebieten der Dozierenden.
content
Angeboten werden folgende Veranstaltungen:

Fundamentals of Computational Environmental Physics (every wintersemester,

4 SWS lecture + 2 SWS exercise session, 8 LP):
Elementary linear models: Flow in porous media, elliptic partial dierential
equations (PDEs), Scalar transport, rst-order hyperbolic PDEs, Contaminant
Transport, parabolic PDEs, Coupled elementary models, active transport, Fluid
dynamics, Stokes and Navier-Stokes equations
Requirements empfohlen sind Veranstaltung(en) aus dem Aufbaumodul Numerik und
for Optimierung
participation
Requirements Jede Veranstaltung wird mit einer benoteten mündlichen oder schriftlichen
for the Prüfung abgeschlossen. Weitere Details werden von der bzw. dem Lehrenden zu
assignment Beginn der Veranstaltung bekannt gegeben.
of credits
and nal
grade
Useful wird im LSF oder auf der Homepage der Vorlesung angegeben
literature

57
Spezialisierungsmodul Statistik und Wahrscheinlichkeitsrechnung

Code Name
MM36 Spezialisierungsmodul Statistik und Wahrscheinlichkeitsrechnung
CP Duration Oered
pro Veranstaltung: ein Semester mindestens jährlich
Format Workload Availability
Es können mehrere verschiedene
Veranstaltungen in diesem
Modul absolviert werden.
M.Sc. Mathematik
M.Sc. Scientic Computing
Language Lecturer(s) Examination scheme
Deutsch oder wechselnd
Englisch
Learning Umfassende Kenntnisse und Verständnis der Strukturen, Aussagen, Methoden
objectives und Beweistechniken der Statistik und Wahrscheinlichkeitstheorie,
Fähigkeit, sich komplexe mathematische Sachverhalte selbst zu erarbeiten und
zu diskutieren
Learning Aktuelle Forschungsthemen aus den Arbeitsgebieten der Dozierenden
content
Requirements empfohlen sind Veranstaltung(en) aus dem Aufbaumodul Statistik und
for Wahrscheinlichkeitsrechnung
participation
Requirements Jede Veranstaltung wird mit einer benoteten mündlichen oder schriftlichen
for the Prüfung abgeschlossen. Weitere Details werden von der bzw. dem Lehrenden zu
assignment Beginn der Veranstaltung bekannt gegeben.
of credits
and nal
grade
Useful wird im LSF oder auf der Homepage der Vorlesung angegeben
literature

58
6 General Modules
This chapter concludes the descriptions of the mandatory modules Seminar, Field of Application
and Master Thesis as ewll as the descriptions for the elective modules Advanced Software Practical
and Lab internship in eld of application.

During the studies three regular seminars must be completed:

 a seminar in mathematics
 a seminar in computer science (can be replaced by the module Advanced Software Practical )
 a master seminar

The master seminar is a regular seminar in mathematics or computer science which must be chosen
following the guidelines of your thesis supervisor. Usually the supervisor will ask you to attend one
of his regular seminars - or the supervisor can point you to a suitable other seminar. The topic of
this seminar should be chosen in preparation of your thesis, but the master seminar is not a seminar
about your thesis research.
A possibility to receive the CP in the Application eld is the new Lab internship in eld of appli-
cation.

59
Seminar

Code Name
SCS Seminar
CP Duration Oered
6 one semester every semester
Format Workload Availability
Seminar 2 180h, thereof M.Sc. Scientic Computing
SWS + 60h seminar and tutorial
tutorial 2 SWS 120h preparation of presentation and
supervision
Language Lecturer(s) Examination scheme
English or depending on teaching oer
German
Learning Ability to read mathematical literature (usually a more demanding text), to deal
objectives with a mathematical problem independently and to present it.
Ability to communicate mathematical arguments clearly and understandably to
a smaller circle of peers.
Knowledge of techniques of scientic writing (especially literature research)
Ability to work on complex scientic literature.
Advanced ability to present complex scientic literature in a lecture.
Advanced ability to discuss lectures and give feedback
Ability to create a short scientic paper on a complex topic
Learning After consultation with the lecturer, in particular a comprehensive counseling
content interview preceding the presentation.
Introduction to and practice of scientic writing techniques.
In-depth training in the development and presentation of scientic literature.
Requirements Recommended prior knowledge will be announced by the lecturer
for
participation
Requirements The module is completed with a graded exam. This exam includes the
for the presentation of about 45- to 90-minute presentation, active and passive
assignment participation in other lectures and a written elaboration of the presentation
of credits (about 10 pages). The appropriate scope, form and content are assessed and
and nal graded. The exam must be passed in order to be awarded the LP. The nal
grade grade of the module is determined by the grade of the exam.
Useful
literature

60
Advanced Software Practical

Code Name
SCASP Advanced Software Practical
CP Duration Oered
8 one semester every semester
Format Workload Availability
6 SWS 240h; thereof at least M.Sc. Scientic Computing
Practical 25 h presence
10 h preparation presentation
Language Lecturer(s) Examination scheme
English or depending on teaching oer
German
Learning Students acquire problem solving competence for complex design and
objectives implementation tasks and deepen their programming ability.
Learning Carry out a project from concept to execution and presentation.
content Specic contents depends on the problem to be solved. General approach of a
software practical includes
- Execution and evaluation of projects and their phase structure
- Planing of team work
- Presentation of project results
Requirements
for
participation
Requirements The module is completed with a graded exam. This exam includes the
for the documented software, the project report and the presentation of the results.
assignment More details will be announced by the lecturer. The nal grade of the module is
of credits determined by the grade of the exam.
and nal
grade
Useful
literature

61
Field of Application

Code Name
SCAP Field of Application
CP Duration Oered
18
Format Workload Availability
540 h, M.Sc. Scientic Computing
Division into presence, practice time,
internship, exercises and
consultation with the lecturer/supervisor.
Language Lecturer(s) Examination scheme
English or
German
Learning In-depth knowledge and skills in an application area
objectives
Learning Selection of one eld of applications to demonstrate applicability of scientic
content computing tools and techniques. Selectable are general elds of research, both
disciplinary and interdisciplinary:
Physics, chemistry, bio-sciences, astronomy, economics, computational
linguistic, medical physics are examples of elds of application.

Modules from the eld of application have to be from a master program of

Heidelberg University. Bachelor modules can be allowed by the dean of studies if
they are needed as prerequisites to attend master modules.
Modules have to have their focus on the led of application - modules teaching
mainly mathematics and/or computer science cannot be credited.
Requirements
for
participation
Requirements According to the regulations of the respective department.
for the
assignment
of credits
and nal
grade
Useful
literature

62
Lab internship in eld of application

Code Name
SCLI Lab internship in eld of application
CP Duration Oered
10 10 weeks
Format Workload Availability
Internship 300 h; thereof M.Sc. Scientic Computing
240 h lab internship according to a lab
internship proposal.
60 h documentation and presentation of
proposal results
Language Lecturer(s) Examination scheme
English or
German
Learning Students denes a research projects, does independent research under
objectives supervision, documents results in written form and presents results to peer
group.
Learning Student gets a research project at a work group in the eld of application. The
content internship is supervised by a lecturer, postdoc or PhD student under the
guidance of the group leader. The research project is carried out in 8 weeks
under supervision as member of the research group. Student is fully immersed
as part of the research group and participates in daily group life.
The content of the lab internship is dened in a lab project proposal which is
dened and signed by student and head of the lab and conrmed by the dean of
studies.
Requirements Preliminaries to complete the dened research project
for
participation
Requirements The module is completed with a graded exam. This exam includes the completed
for the project according to proposal, the presentation and the project documentation.
assignment
of credits
and nal
grade
Useful
literature

63
Master Thesis

Code Name
SCMa Master Thesis
CP Duration Oered
30 one semester
Format Workload Availability
900 h; thereof M.Sc. Scientic Computing
810 h working on a thesis topic (research and
development tasks)
90 h for preparing and giving a thesis
presentation
Language Lecturer(s) Examination scheme
English or depending on oer
German
Learning Supervised research work in a specic research area of Scientic Computing
objectives
Learning Research work on a specic topic in Scientic Computing
content
Requirements According to the examination regulations, Ÿ14.2, the amount of 45 credits have
for to be completed and registered before the master thesis can be registered.
participation
Requirements Passing the graded master's thesis is required for the award of the CP.
for the Composite grade: 90% thesis (grade given by the two thesis examiners), 10%
assignment presentation (grade given by the two examiners)
of credits
and nal
grade
Useful Given by supervisor.
literature

64
7 Key Competence Program
In this chapter the module descriptions the modules of the Key Competence Program are listed.

This list is still in progress.

The course C++ Practice from the MSc Technische Informatik can also be chosen.

65
Einführung in das Textsatzsystem LaTeX

Code Name
ILat Einführung in das Textsatzsystem LaTeX
CP Duration Oered
2 ÜK ein Semester unregelmäÿig
Format Workload Availability
Praktikum 2 60 h; davon B.Sc. Angewandte Informatik
SWS 30 h Präsenzstudium B.Sc. Informatik
15 h praktische Übung am Rechner B.Sc. Mathematik
15 h Hausaufgaben M.Sc. Scientic Computing
Language Lecturer(s) Examination scheme
Deutsch wechselnd 1+1
Learning Nachdem Studierende die Veranstaltung besucht haben, können sie
objectives * ein TeX-System installieren und einrichten.
* LaTeX-Dokumente mit komplexer Struktur erstellen und bearbeiten.
* gängige Fehler in LaTeX-Dokumenten identizieren und beheben.
* LaTeX-Makros programmieren.
* LaTeX-Umgebungen mit verschiedenen Paketen aufsetzen.
Learning Der Kurs gibt eine Einführung in das Satzsystem LaTeX und vermittelt
content grundlegende typographische Kenntnisse. Ziel des Kurses ist es, längere und
komplexe Dokumente (z. B. Bachelor- und Masterarbeiten sowie Dissertationen)
eigenständig in hoher Qualität zu entwickeln, ohne auf die Probleme zu stoÿen,
die ein komplexes System wie LaTeX dem Anfänger bereitet. Es werden
weiterhin auch moderne Konzepte und Entwicklungen von LaTeX vorgestellt,
die dem Anwender interessante und hilfreiche
Tools zur Verfügung stellen. Behandelt werden u.a.
* allgemeine Formatierung, Pakete Schriften
* Gleitobjekte: Bilder, Tabellen
* Verzeichnisse
* Mathematiksatz
* mehrsprachige Dokumente
* Präsentationen
* Diagramme
* Typographische Feinheiten
* Professionelle Briefe, Lebenslauf
Requirements none
for
participation
Requirements Die Details werden zu Beginn der Lehrveranstaltung bekannt gegeben.
for the
assignment
of credits
and nal
grade

66
Useful
literature

67