Search result: Catalogue data in Autumn Semester 2019

Computational Science and Engineering Bachelor Information
Bachelor Studies (Programme Regulations 2018)
First Year Compulsory Courses
First Year Examination Block 1
NumberTitleTypeECTSHoursLecturers
401-0151-00LLinear Algebra Information Restricted registration - show details O5 credits3V + 2UV. C. Gradinaru
AbstractContents: Linear systems - the Gaussian algorithm, matrices - LU decomposition, determinants, vector spaces, least squares - QR decomposition, linear maps, eigenvalue problem, normal forms - singular value decomposition; numerical aspects; introduction to MATLAB.
ObjectiveEinführung in die Lineare Algebra für Ingenieure unter Berücksichtigung numerischer Aspekte
Lecture notesK. Nipp / D. Stoffer, Lineare Algebra, vdf Hochschulverlag, 5. Auflage 2002
LiteratureK. Nipp / D. Stoffer, Lineare Algebra, vdf Hochschulverlag, 5. Auflage 2002
252-0025-01LDiscrete Mathematics Information O7 credits4V + 2UU. Maurer
AbstractContent: Mathematical reasoning and proofs, abstraction. Sets, relations (e.g. equivalence and order relations), functions, (un-)countability, number theory, algebra (groups, rings, fields, polynomials, subalgebras, morphisms), logic (propositional and predicate logic, proof calculi).
ObjectiveThe primary goals of this course are (1) to introduce the most important concepts of discrete mathematics, (2) to understand and appreciate the role of abstraction and mathematical proofs, and (3) to discuss a number of applications, e.g. in cryptography, coding theory, and algorithm theory.
ContentSee course description.
Lecture notesavailable (in english)
252-0856-00LComputer Science Information O4 credits2V + 2UF. Friedrich Wicker, M. Schwerhoff
AbstractThe course covers the fundamental concepts of computer programming with a focus on systematic algorithmic problem solving. Taught language is C++. No programming experience is required.
ObjectivePrimary educational objective is to learn programming with C++. After having successfully attended the course, students have a good command of the mechanisms to construct a program. They know the fundamental control and data structures and understand how an algorithmic problem is mapped to a computer program. They have an idea of what happens "behind the scenes" when a program is translated and executed. Secondary goals are an algorithmic computational thinking, understanding the possibilities and limits of programming and to impart the way of thinking like a computer scientist.
ContentThe course covers fundamental data types, expressions and statements, (limits of) computer arithmetic, control statements, functions, arrays, structural types and pointers. The part on object orientation deals with classes, inheritance and polymorphism; simple dynamic data types are introduced as examples. In general, the concepts provided in the course are motivated and illustrated with algorithms and applications.
Lecture notesEnglish lecture notes will be provided during the semester. The lecture notes and the lecture slides will be made available for download on the course web page. Exercises are solved and submitted online.
LiteratureBjarne Stroustrup: Einführung in die Programmierung mit C++, Pearson Studium, 2010
Stephen Prata, C++ Primer Plus, Sixth Edition, Addison Wesley, 2012
Andrew Koenig and Barbara E. Moo: Accelerated C++, Addison-Wesley, 2000
First Year Examination Block 2
NumberTitleTypeECTSHoursLecturers
401-0231-10LAnalysis 1 Information Restricted registration - show details
Students in BSc EEIT may instead register for 401-1261-07L Analysis I (for BSc Mathematics, BSc Physics and BSc Interdisciplinary Science (Phys Chem)) and take the performance assessment of the corresponding two-semester course. Students in BSc EEIT who wish to register for 401-1261-07L/401-1262-07L Analysis I/II instead of 401-0231-10L/401-0232-10L Analysis 1/2 must get in touch with the Study Administration before the registration.
O8 credits4V + 3UP. Feller
AbstractReelle und komplexe Zahlen, Grenzwerte, Folgen, Reihen, Potenzreihen, stetige Abbildungen, Differential- und Integralrechnung einer Variablen, Einführung in gewöhnliche Differentialgleichungen
ObjectiveEinführung in die Grundlagen der Analysis
Lecture notesChristian Blatter: Ingenieur-Analysis (Kapitel 1-4)
LiteratureKonrad Koenigsberger, Analysis I.
Christian Blatter, Analysis I.
402-0043-00LPhysics IO4 credits3V + 1US. P. Quanz
AbstractIntroduction to the concepts and tools in physics with the help of demonstration experiments: mechanics of point-like and ridged bodies, periodic motion and mechanical waves.
ObjectiveThe concepts and tools in physics, as well as the methods of an experimental science are taught. The student should learn to identify, communicate and solve physical problems in his/her own field of science.
ContentMechanics (motion, Newton's laws, work and energy, conservation of momentum, rotation, gravitation, fluids)
Periodic Motion and Waves (periodic motion, mechanical waves, acoustics).
Lecture notesThe lecture follows the book "Physics" by Paul A. Tipler.
LiteraturePaul A. Tipler and Gene P. Mosca, Physics (for Scientists and Engineers), W. H. Freeman and Company
Basic Courses
Block G1
NumberTitleTypeECTSHoursLecturers
401-0353-00LAnalysis 3 Information O4 credits2V + 2UM. Iacobelli
AbstractIn this lecture we treat problems in applied analysis. The focus lies on the solution of quasilinear first order PDEs with the method of characteristics, and on the study of three fundamental types of partial differential equations of second order: the Laplace equation, the heat equation, and the wave equation.
ObjectiveThe aim of this class is to provide students with a general overview of first and second order PDEs, and teach them how to solve some of these equations using characteristics and/or separation of variables.
Content1.) General introduction to PDEs and their classification (linear, quasilinear, semilinear, nonlinear / elliptic, parabolic, hyperbolic)

2.) Quasilinear first order PDEs
- Solution with the method of characteristics
- COnservation laws

3.) Hyperbolic PDEs
- wave equation
- d'Alembert formula in (1+1)-dimensions
- method of separation of variables

4.) Parabolic PDEs
- heat equation
- maximum principle
- method of separation of variables

5.) Elliptic PDEs
- Laplace equation
- maximum principle
- method of separation of variables
- variational method
LiteratureY. Pinchover, J. Rubinstein, "An Introduction to Partial Differential Equations", Cambridge University Press (12. Mai 2005)
Prerequisites / NoticePrerequisites: Analysis I and II, Fourier series (Complex Analysis)
401-0647-00LIntroduction to Mathematical Optimization Information O5 credits2V + 1UD. Adjiashvili
AbstractIntroduction to basic techniques and problems in mathematical optimization, and their applications to a variety of problems in engineering.
ObjectiveThe goal of the course is to obtain a good understanding of some of the most fundamental mathematical optimization techniques used to solve linear programs and basic combinatorial optimization problems. The students will also practice applying the learned models to problems in engineering.
ContentTopics covered in this course include:
- Linear programming (simplex method, duality theory, shadow prices, ...).
- Basic combinatorial optimization problems (spanning trees, shortest paths, network flows, ...).
- Modelling with mathematical optimization: applications of mathematical programming in engineering.
LiteratureInformation about relevant literature will be given in the lecture.
Prerequisites / NoticeThis course is meant for students who did not already attend the course "Mathematical Optimization", which is a more advance lecture covering similar topics. Compared to "Mathematical Optimization", this course has a stronger focus on modeling and applications.
401-0663-00LNumerical Methods for CSEO8 credits4V + 2U + 1PR. Hiptmair
AbstractThe course gives an introduction into fundamental techniques and algorithms of numerical mathematics which play a central role in numerical simulations in science and technology. The course focuses on fundamental ideas and algorithmic aspects of numerical methods. The exercises involve actual implementation of numerical methods in C++.
Objective* Knowledge of the fundamental algorithms in numerical mathematics
* Knowledge of the essential terms in numerical mathematics and the
techniques used for the analysis of numerical algorithms
* Ability to choose the appropriate numerical method for concrete problems
* Ability to interpret numerical results
* Ability to implement numerical algorithms afficiently
Content* Computing with Matrices and Vectors
* Direct Methods for linear systems of equations
* Least Squares Techniques
* Data Interpolation and Fitting
[ Filtering Algorithms, optional]
* Approximation of Functions
* Numerical Quadrature
* Iterative Methods for non-linear systems of equations
* Single Step Methods for ODEs
* Stiff Integrators
Lecture notesLecture materials (PDF documents and codes) will be made available to the participants through the course web page, whose address will be announced in the beginning of the course.
LiteratureU. ASCHER AND C. GREIF, A First Course in Numerical Methods, SIAM, Philadelphia, 2011.

A. QUARTERONI, R. SACCO, AND F. SALERI, Numerical mathematics, vol. 37 of Texts in Applied Mathematics, Springer, New York, 2000.

W. Dahmen, A. Reusken "Numerik für Ingenieure und Naturwissenschaftler", Springer 2006.

W. Gander, M.J. Gander, and F. Kwok "Scientific Computing", Springer 2014.

M. Hanke-Bourgeois "Grundlagen der Numerischen Mathematik und des wissenschaftlichen Rechnens", BG Teubner, 2002

P. Deuflhard and A. Hohmann, "Numerische Mathematik I", DeGruyter, 2002
Prerequisites / NoticeThe course will be accompanied by programming exercises in C++ relying on the template library EIGEN. Familiarity with C++, object oriented and generic programming is an advantage. Participants of the course are expected to learn C++ by themselves.
Block G2
NumberTitleTypeECTSHoursLecturers
402-0811-00LProgramming Techniques for Scientific Simulations IO5 credits4GR. Käppeli
AbstractThis lecture provides an overview of programming techniques for scientific simulations. The focus is on basic and advanced C++ programming techniques and scientific software libraries. Based on an overview over the hardware components of PCs and supercomputer, optimization methods for scientific simulation codes are explained.
Objective
252-0061-00LSystems Programming and Computer Architecture Information O7 credits4V + 2UT. Roscoe
AbstractIntroduction to systems programming. C and assembly language,
floating point arithmetic, basic translation of C into assembler,
compiler optimizations, manual optimizations. How hardware features
like superscalar architecture, exceptions and interrupts, caches,
virtual memory, multicore processors, devices, and memory systems
function and affect correctness, performance, and optimization.
ObjectiveThe course objectives are for students to:

1. Develop a deep understanding of, and intuition about, the execution
of all the layers (compiler, runtime, OS, etc.) between programs in
high-level languages and the underlying hardware: the impact of
compiler decisions, the role of the operating system, the effects
of hardware on code performance and scalability, etc.

2. Be able to write correct, efficient programs on modern hardware,
not only in C but high-level languages as well.

3. Understand Systems Programming as a complement to other disciplines
within Computer Science and other forms of software development.

This course does not cover how to design or build a processor or
computer.
ContentThis course provides an overview of "computers" as a
platform for the execution of (compiled) computer programs. This
course provides a programmer's view of how computer systems execute
programs, store information, and communicate. The course introduces
the major computer architecture structures that have direct influence
on the execution of programs (processors with registers, caches, other
levels of the memory hierarchy, supervisor/kernel mode, and I/O
structures) and covers implementation and representation issues only
to the extend that they are necessary to understand the structure and
operation of a computer system.

The course attempts to expose students to the practical issues that
affect performance, portability, security, robustness, and
extensibility. This course provides a foundation for subsequent
courses on operating systems, networks, compilers and many other
courses that require an understanding of the system-level
issues. Topics covered include: machine-level code and its generation
by optimizing compilers, address translation, input and output,
trap/event handlers, performance evaluation and optimization (with a
focus on the practical aspects of data collection and analysis).
Lecture notes- C programmnig
- Integers
- Pointers and dynamic memory allocation
- Basic computer architecture
- Compiling C control flow and data structures
- Code vulnerabilities
- Implementing memory allocation
- Linking
- Floating point
- Optimizing compilers
- Architecture and optimization
- Caches
- Exceptions
- Virtual memory
- Multicore
- Devices
LiteratureThe course is based in part on "Computer Systems: A Programmer's Perspective" (3rd Edition) by R. Bryant and D. O'Hallaron, with additional material.
Prerequisites / Notice252-0029-00L Parallel Programming
252-0028-00L Design of Digital Circuits
Block G3
All course units within Block G3 are offered in the spring semester.
Block G4
All course units within Block G4 are offered in the spring semester.
Core Courses from Group I (Modules)
Module A
NumberTitleTypeECTSHoursLecturers
151-0107-20LHigh Performance Computing for Science and Engineering (HPCSE) IW4 credits4GP. Koumoutsakos
AbstractThis course gives an introduction into algorithms and numerical methods for parallel computing on shared and distributed memory architectures. The algorithms and methods are supported with problems that appear frequently in science and engineering.
ObjectiveWith manufacturing processes reaching its limits in terms of transistor density on today’s computing architectures, efficient utilization of computing resources must include parallel execution to maintain scaling. The use of computers in academia, industry and society is a fundamental tool for problem solving today while the “think parallel” mind-set of developers is still lagging behind.

The aim of the course is to introduce the student to the fundamentals of parallel programming using shared and distributed memory programming models. The goal is on learning to apply these techniques with the help of examples frequently found in science and engineering and to deploy them on large scale high performance computing (HPC) architectures.
Content1. Hardware and Architecture: Moore’s Law, Instruction set architectures (MIPS, RISC, CISC), Instruction pipelines, Caches, Flynn’s taxonomy, Vector instructions (for Intel x86)

2. Shared memory parallelism: Threads, Memory models, Cache coherency, Mutual exclusion, Uniform and Non-Uniform memory access, Open Multi-Processing (OpenMP)

3. Distributed memory parallelism: Message Passing Interface (MPI), Point-to-Point and collective communication, Blocking and non-blocking methods, Parallel file I/O, Hybrid programming models

4. Performance and parallel efficiency analysis: Performance analysis of algorithms, Roofline model, Amdahl’s Law, Strong and weak scaling analysis

5. Applications: HPC Math libraries, Linear Algebra and matrix/vector operations, Singular value decomposition, Neural Networks and linear autoencoders, Solving partial differential equations (PDEs) using grid-based and particle methods
Lecture notesLink
Class notes, handouts
Literature• An Introduction to Parallel Programming, P. Pacheco, Morgan Kaufmann
• Introduction to High Performance Computing for Scientists and Engineers, G. Hager and G. Wellein, CRC Press
• Computer Organization and Design, D.H. Patterson and J.L. Hennessy, Morgan Kaufmann
• Vortex Methods, G.H. Cottet and P. Koumoutsakos, Cambridge University Press
• Lecture notes
Prerequisites / NoticeStudents should be familiar with a compiled programming language (C, C++ or Fortran). Exercises and exams will be designed using C++. The course will not teach basics of programming. Some familiarity using the command line is assumed. Students should also have a basic understanding of diffusion and advection processes, as well as their underlying partial differential equations.
Module B
NumberTitleTypeECTSHoursLecturers
263-2800-00LDesign of Parallel and High-Performance Computing Information Restricted registration - show details W8 credits3V + 2U + 2AM. Püschel, T. Ben Nun
AbstractAdvanced topics in parallel / concurrent programming.
ObjectiveUnderstand concurrency paradigms and models from a higher perspective and acquire skills for designing, structuring and developing possibly large concurrent software systems. Become able to distinguish parallelism in problem space and in machine space. Become familiar with important technical concepts and with concurrency folklore.
Core Courses from Group II
No offering in the Autumn Semester
Bachelor's Thesis
If you wish to have recognised 402-2000-00L Scientific Works in Physics instead of 401-2000-00L Scientific Works in Mathematics (as allowed for the CSE programme), take contact with the Study Administration Office (Link) after having passed the performance assessment.
NumberTitleTypeECTSHoursLecturers
401-2000-00LScientific Works in Mathematics
Target audience:
Third year Bachelor students;
Master students who cannot document to have received an adequate training in working scientifically.
O0 creditsÖ. Imamoglu
AbstractIntroduction to scientific writing for students with focus on publication standards and ethical issues, especially in the case of citations (references to works of others.)
ObjectiveLearn the basic standards of scientific works in mathematics.
Content- Types of mathematical works
- Publication standards in pure and applied mathematics
- Data handling
- Ethical issues
- Citation guidelines
Prerequisites / NoticeDirective Link
401-2000-01LLunch Sessions – Thesis Basics for Mathematics Students
Details and registration for the optional MathBib training course: Link
Z0 creditsSpeakers
AbstractOptional MathBib training course
Objective
402-2000-00LScientific Works in Physics
Target audience:
Master students who cannot document to have received an adequate training in working scientifically.

Directive Link
W0 creditsC. Grab
AbstractLiterature Review: ETH-Library, Journals in Physics, Google Scholar; Thesis Structure: The IMRAD Model; Document Processing: LaTeX and BibTeX, Mathematical Writing, AVETH Survival Guide; ETH Guidelines for Integrity; Authorship Guidelines; ETH Citation Etiquettes; Declaration of Originality.
ObjectiveBasic standards for scientific works in physics: How to write a Master Thesis. What to know about research integrity.
401-3990-18LBachelor's Thesis Restricted registration - show details
Only for Computational Science and Engineering BSc, Programme Regulations 2018.

Successful participation in the course unit 401-2000-00L Scientific Works in Mathematics or 402-2000-00L Scientific Works in Physicsis is required.
For more information, see Link
O14 credits30DSupervisors
AbstractThe BSc thesis concludes the curriculum. In their BSc thesis, students should demonstrate their ability to carry out independent, structured scientific work. The purpose of the BSc thesis is to deepen knowledge in a certain subject and to bring students into closer contact with applications in an existing computational group. The BSc thesis requires approximately 420 hours of work.
ObjectiveIn their Bsc thesis students should demonstrate their ability to carry out independent, structured scientific work. The purpose is to deepen knowledge in a certain subject and to enable students to collaborate in an existing scientific group to take a computational approach to problems encountered in applications.
Prerequisites / NoticeThe supervisor responsible for the Bachelor thesis defines the task and determines the start and the submission date. The Bachelor thesis concludes with a written report. The Bachelor thesis is graded.
Bachelor Studies (Programme Regulations 2012 and 2016)
Basic Courses
Block G1 (Programme Regulations 2012 and 2016)
NumberTitleTypeECTSHoursLecturers
401-0353-00LAnalysis 3 Information O4 credits2V + 2UM. Iacobelli
AbstractIn this lecture we treat problems in applied analysis. The focus lies on the solution of quasilinear first order PDEs with the method of characteristics, and on the study of three fundamental types of partial differential equations of second order: the Laplace equation, the heat equation, and the wave equation.
ObjectiveThe aim of this class is to provide students with a general overview of first and second order PDEs, and teach them how to solve some of these equations using characteristics and/or separation of variables.
Content1.) General introduction to PDEs and their classification (linear, quasilinear, semilinear, nonlinear / elliptic, parabolic, hyperbolic)

2.) Quasilinear first order PDEs
- Solution with the method of characteristics
- COnservation laws

3.) Hyperbolic PDEs
- wave equation
- d'Alembert formula in (1+1)-dimensions
- method of separation of variables

4.) Parabolic PDEs
- heat equation
- maximum principle
- method of separation of variables

5.) Elliptic PDEs
- Laplace equation
- maximum principle
- method of separation of variables
- variational method
LiteratureY. Pinchover, J. Rubinstein, "An Introduction to Partial Differential Equations", Cambridge University Press (12. Mai 2005)
Prerequisites / NoticePrerequisites: Analysis I and II, Fourier series (Complex Analysis)
402-0811-00LProgramming Techniques for Scientific Simulations IO5 credits4GR. Käppeli
AbstractThis lecture provides an overview of programming techniques for scientific simulations. The focus is on basic and advanced C++ programming techniques and scientific software libraries. Based on an overview over the hardware components of PCs and supercomputer, optimization methods for scientific simulation codes are explained.
Objective
401-0663-00LNumerical Methods for CSEO8 credits4V + 2U + 1PR. Hiptmair
AbstractThe course gives an introduction into fundamental techniques and algorithms of numerical mathematics which play a central role in numerical simulations in science and technology. The course focuses on fundamental ideas and algorithmic aspects of numerical methods. The exercises involve actual implementation of numerical methods in C++.
Objective* Knowledge of the fundamental algorithms in numerical mathematics
* Knowledge of the essential terms in numerical mathematics and the
techniques used for the analysis of numerical algorithms
* Ability to choose the appropriate numerical method for concrete problems
* Ability to interpret numerical results
* Ability to implement numerical algorithms afficiently
Content* Computing with Matrices and Vectors
* Direct Methods for linear systems of equations
* Least Squares Techniques
* Data Interpolation and Fitting
[ Filtering Algorithms, optional]
* Approximation of Functions
* Numerical Quadrature
* Iterative Methods for non-linear systems of equations
* Single Step Methods for ODEs
* Stiff Integrators
Lecture notesLecture materials (PDF documents and codes) will be made available to the participants through the course web page, whose address will be announced in the beginning of the course.
LiteratureU. ASCHER AND C. GREIF, A First Course in Numerical Methods, SIAM, Philadelphia, 2011.

A. QUARTERONI, R. SACCO, AND F. SALERI, Numerical mathematics, vol. 37 of Texts in Applied Mathematics, Springer, New York, 2000.

W. Dahmen, A. Reusken "Numerik für Ingenieure und Naturwissenschaftler", Springer 2006.

W. Gander, M.J. Gander, and F. Kwok "Scientific Computing", Springer 2014.

M. Hanke-Bourgeois "Grundlagen der Numerischen Mathematik und des wissenschaftlichen Rechnens", BG Teubner, 2002

P. Deuflhard and A. Hohmann, "Numerische Mathematik I", DeGruyter, 2002
Prerequisites / NoticeThe course will be accompanied by programming exercises in C++ relying on the template library EIGEN. Familiarity with C++, object oriented and generic programming is an advantage. Participants of the course are expected to learn C++ by themselves.
Block G2 (Programme Regulations 2012 and 2016)
252-0834-00L Information Systems for Engineers will be offered in the Spring Semester.
NumberTitleTypeECTSHoursLecturers
401-0603-00LStochastics (Probability and Statistics) Information Restricted registration - show details O4 credits2V + 1UC. Czichowsky
AbstractThis class covers the following concepts: random variables, probability, discrete and continuous distributions, joint and conditional probabilities and distributions, the law of large numbers, the central limit theorem, descriptive statistics, statistical inference, inference for normally distributed data, point estimation, and two-sample tests.
ObjectiveKnowledge of the basic principles of probability and statistics.
ContentIntroduction to probability theory, some basic principles from mathematical statistics and basic methods for applied statistics.
Lecture notesLecture notes
LiteratureLecture notes
252-0834-00LInformation Systems for Engineers Information
Does not take place this semester.
O4 credits2V + 1Uto be announced
AbstractThis course provides the basics of relational databases from the perspective of the user.

We will discover why tables are so incredibly powerful to express relations, learn the SQL query language, and how to make the most of it. The course also covers support for data cubes (analytics).

After this course, you will be ready for Big Data for Engineers.
ObjectiveAfter visiting this course, you will be capable to:

1. Explain, in the big picture, how a relational database works and what it can do in your own words.

2. Explain the relational data model (tables, rows, attributes, primary keys, foreign keys), formally and informally, including the relational algebra operators (select, project, rename, all kinds of joins, division, cartesian product, union, intersection, etc).

3. Perform non-trivial reading SQL queries on existing relational databases, as well as insert new data, update and delete existing data.

4. Design new schemas to store data in accordance to the real world's constraints, such as relationship cardinality

5. Explain what bad design is and why it matters.

6. Adapt and improve an existing schema to make it more robust against anomalies, thanks to a very good theoretical knowledge of what is called "normal forms".

7. Understand how indices work (hash indices, B-trees), how they are implemented, and how to use them to make queries faster.

8. Access an existing relational database from a host language such as Java, using bridges such as JDBC.

9. Explain what data independence is all about and didn't age a bit since the 1970s.

10. Explain, in the big picture, how a relational database is physically implemented.

11. Know and deal with the natural syntax for relational data, CSV.

12. Explain the data cube model including slicing and dicing.

13. Store data cubes in a relational database.

14. Map cube queries to SQL.

15. Slice and dice cubes in a UI.

And of course, you will think that tables are the most wonderful object in the world.
ContentUsing a relational database
=================
1. Introduction
2. The relational model
3. Data definition with SQL
4. The relational algebra
5. Queries with SQL

Taking a relational database to the next level
=================
6. Database design theory
7. Databases and host languages
8. Databases and host languages
9. Indices and optimization
10. Database architecture and storage

Analytics on top of a relational database
=================
12. Data cubes

Outlook
=================
13. Outlook
Literature- Lecture material (slides).

- Book: "Database Systems: The Complete Book", H. Garcia-Molina, J.D. Ullman, J. Widom
(It is not required to buy the book, as the library has it)
Prerequisites / NoticeFor non-CS/DS students only, BSc and MSc
Elementary knowledge of set theory and logics
Knowledge as well as basic experience with a programming language such as Pascal, C, C++, Java, Haskell, Python
401-0647-00LIntroduction to Mathematical Optimization Information O5 credits2V + 1UD. Adjiashvili
AbstractIntroduction to basic techniques and problems in mathematical optimization, and their applications to a variety of problems in engineering.
ObjectiveThe goal of the course is to obtain a good understanding of some of the most fundamental mathematical optimization techniques used to solve linear programs and basic combinatorial optimization problems. The students will also practice applying the learned models to problems in engineering.
ContentTopics covered in this course include:
- Linear programming (simplex method, duality theory, shadow prices, ...).
- Basic combinatorial optimization problems (spanning trees, shortest paths, network flows, ...).
- Modelling with mathematical optimization: applications of mathematical programming in engineering.
LiteratureInformation about relevant literature will be given in the lecture.
Prerequisites / NoticeThis course is meant for students who did not already attend the course "Mathematical Optimization", which is a more advance lecture covering similar topics. Compared to "Mathematical Optimization", this course has a stronger focus on modeling and applications.
Block G3 (Programme Regulations 2012 and 2016)
All course units within Block G3 are offered in the spring semester.
Block G4 (Programme Regulations 2012 and 2016)
Students that enrol for the second year in the CSE Bachelor Programme and whose first year examination did not involve the subject "Physics I" will instead take the "Physics I and II" (402-0043-00L and 402-0044-00L) courses with performance assessment as a yearly course.
NumberTitleTypeECTSHoursLecturers
402-0043-00LPhysics IW4 credits3V + 1US. P. Quanz
AbstractIntroduction to the concepts and tools in physics with the help of demonstration experiments: mechanics of point-like and ridged bodies, periodic motion and mechanical waves.
ObjectiveThe concepts and tools in physics, as well as the methods of an experimental science are taught. The student should learn to identify, communicate and solve physical problems in his/her own field of science.
ContentMechanics (motion, Newton's laws, work and energy, conservation of momentum, rotation, gravitation, fluids)
Periodic Motion and Waves (periodic motion, mechanical waves, acoustics).
Lecture notesThe lecture follows the book "Physics" by Paul A. Tipler.
LiteraturePaul A. Tipler and Gene P. Mosca, Physics (for Scientists and Engineers), W. H. Freeman and Company
Core Courses
NumberTitleTypeECTSHoursLecturers
151-0107-20LHigh Performance Computing for Science and Engineering (HPCSE) IO4 credits4GP. Koumoutsakos
AbstractThis course gives an introduction into algorithms and numerical methods for parallel computing on shared and distributed memory architectures. The algorithms and methods are supported with problems that appear frequently in science and engineering.
ObjectiveWith manufacturing processes reaching its limits in terms of transistor density on today’s computing architectures, efficient utilization of computing resources must include parallel execution to maintain scaling. The use of computers in academia, industry and society is a fundamental tool for problem solving today while the “think parallel” mind-set of developers is still lagging behind.

The aim of the course is to introduce the student to the fundamentals of parallel programming using shared and distributed memory programming models. The goal is on learning to apply these techniques with the help of examples frequently found in science and engineering and to deploy them on large scale high performance computing (HPC) architectures.
Content1. Hardware and Architecture: Moore’s Law, Instruction set architectures (MIPS, RISC, CISC), Instruction pipelines, Caches, Flynn’s taxonomy, Vector instructions (for Intel x86)

2. Shared memory parallelism: Threads, Memory models, Cache coherency, Mutual exclusion, Uniform and Non-Uniform memory access, Open Multi-Processing (OpenMP)

3. Distributed memory parallelism: Message Passing Interface (MPI), Point-to-Point and collective communication, Blocking and non-blocking methods, Parallel file I/O, Hybrid programming models

4. Performance and parallel efficiency analysis: Performance analysis of algorithms, Roofline model, Amdahl’s Law, Strong and weak scaling analysis

5. Applications: HPC Math libraries, Linear Algebra and matrix/vector operations, Singular value decomposition, Neural Networks and linear autoencoders, Solving partial differential equations (PDEs) using grid-based and particle methods
Lecture notesLink
Class notes, handouts
Literature• An Introduction to Parallel Programming, P. Pacheco, Morgan Kaufmann
• Introduction to High Performance Computing for Scientists and Engineers, G. Hager and G. Wellein, CRC Press
• Computer Organization and Design, D.H. Patterson and J.L. Hennessy, Morgan Kaufmann
• Vortex Methods, G.H. Cottet and P. Koumoutsakos, Cambridge University Press
• Lecture notes
Prerequisites / NoticeStudents should be familiar with a compiled programming language (C, C++ or Fortran). Exercises and exams will be designed using C++. The course will not teach basics of programming. Some familiarity using the command line is assumed. Students should also have a basic understanding of diffusion and advection processes, as well as their underlying partial differential equations.
Bachelor's Thesis
If you wish to have recognised 402-2000-00L Scientific Works in Physics instead of 401-2000-00L Scientific Works in Mathematics (as allowed for the CSE programme), take contact with the Study Administration Office (Link) after having passed the performance assessment.
NumberTitleTypeECTSHoursLecturers
401-2000-00LScientific Works in Mathematics
Target audience:
Third year Bachelor students;
Master students who cannot document to have received an adequate training in working scientifically.
O0 creditsÖ. Imamoglu
AbstractIntroduction to scientific writing for students with focus on publication standards and ethical issues, especially in the case of citations (references to works of others.)
ObjectiveLearn the basic standards of scientific works in mathematics.
Content- Types of mathematical works
- Publication standards in pure and applied mathematics
- Data handling
- Ethical issues
- Citation guidelines
Prerequisites / NoticeDirective Link
401-2000-01LLunch Sessions – Thesis Basics for Mathematics Students
Details and registration for the optional MathBib training course: Link
Z0 creditsSpeakers
AbstractOptional MathBib training course
Objective
402-2000-00LScientific Works in Physics
Target audience:
Master students who cannot document to have received an adequate training in working scientifically.

Directive Link
W0 creditsC. Grab
AbstractLiterature Review: ETH-Library, Journals in Physics, Google Scholar; Thesis Structure: The IMRAD Model; Document Processing: LaTeX and BibTeX, Mathematical Writing, AVETH Survival Guide; ETH Guidelines for Integrity; Authorship Guidelines; ETH Citation Etiquettes; Declaration of Originality.
ObjectiveBasic standards for scientific works in physics: How to write a Master Thesis. What to know about research integrity.
401-3990-01LBachelor's Thesis Restricted registration - show details
Only for Computational Science and Engineering BSc, Programme Regulations 2012 and 2016.

Successful participation in the course unit 401-2000-00L Scientific Works in Mathematics or 402-2000-00L Scientific Works in Physicsis is required.
For more information, see Link
O8 credits11DSupervisors
AbstractThe BSc thesis concludes the curriculum. In their BSc thesis, students should demonstrate their ability to carry out independent, structured scientific work. The purpose of the BSc thesis is to deepen knowledge in a certain subject and to bring students into closer contact with applications in an existing computational group. The BSc thesis requires approximately 160 hours of work.
ObjectiveIn their Bsc thesis students should demonstrate their ability to carry out independent, structured scientific work. The purpose is to deepen knowledge in a certain subject and to enable students to collaborate in an existing scientific group to take a computational approach to problems encountered in applications.
Prerequisites / NoticeThe supervisor responsible for the Bachelor thesis defines the task and determines the start and the submission date. The Bachelor thesis concludes with a written report. The Bachelor thesis is graded.
For All Programme Regulations
Fields of Specialization
Astrophysics
NumberTitleTypeECTSHoursLecturers
401-7851-00LTheoretical Astrophysics (University of Zurich) Information
No enrolment to this course at ETH Zurich. Book the corresponding module directly at UZH.
UZH Module Code: AST512

Mind the enrolment deadlines at UZH:
Link
W10 credits4V + 2UR. Teyssier
AbstractThis course covers the foundations of astrophysical fluid dynamics, the Boltzmann equation, equilibrium systems and their stability, the structure of stars, astrophysical turbulence, accretion disks and their stability, the foundations of radiative transfer, collisionless systems, the structure and stability of dark matter halos and stellar galactic disks.
Objective
ContentThis course covers the foundations of astrophysical fluid dynamics, the theory of collisions and the Boltzmann equation, the notion of equilibrium systems and their stability, the structure of stars, the theory of astrophysical turbulence, the theory of accretion disks and their stability, the foundations of astrophysical radiative transfer, the theory of collisionless system, the structure and stability of dark matter halos and stellar galactic disks.
LiteratureCourse Materials:
1- The Physics of Astrophysics, Volume 1: Radiation by Frank H. Shu
2- The Physics of Astrophysics, Volume 2: Gas Dynamics by Frank H. Shu
3- Foundations of radiation hydrodynamics, Dimitri Mihalas and Barbara Weibel-Mihalas
4- Radiative Processes in Astrophysics, George B. Rybicki and Alan P. Lightman
5- Galactic Dynamics, James Binney and Scott Tremaine
Prerequisites / NoticeThis is a full black board ad chalk experience for students with a strong background in mathematics and physics.

Prerequisites:
Introduction to Astrophysics
Mathematical Methods for the Physicist
Quantum Mechanics
(All preferred but not obligatory)

Prior Knowledge:
Mechanics
Quantum Mechanics and atomic physics
Thermodynamics
Fluid Dynamics
Electrodynamics
401-7855-00LComputational Astrophysics (University of Zurich)
No enrolment to this course at ETH Zurich. Book the corresponding module directly at UZH.
UZH Module Code: AST245

Mind the enrolment deadlines at UZH:
Link
W6 credits2VL. M. Mayer
Abstract
ObjectiveAcquire knowledge of main methodologies for computer-based models of astrophysical systems,the physical equations behind them, and train such knowledge with simple examples of computer programmes
Content1. Integration of ODE, Hamiltonians and Symplectic integration techniques, time adaptivity, time reversibility
2. Large-N gravity calculation, collisionless N-body systems and their simulation
3. Fast Fourier Transform and spectral methods in general
4. Eulerian Hydrodynamics: Upwinding, Riemann solvers, Limiters
5. Lagrangian Hydrodynamics: The SPH method
6. Resolution and instabilities in Hydrodynamics
7. Initial Conditions: Cosmological Simulations and Astrophysical Disks
8. Physical Approximations and Methods for Radiative Transfer in Astrophysics
LiteratureGalactic Dynamics (Binney & Tremaine, Princeton University Press),
Computer Simulation using Particles (Hockney & Eastwood CRC press),
Targeted journal reviews on computational methods for astrophysical fluids (SPH, AMR, moving mesh)
Prerequisites / NoticeSome knowledge of UNIX, scripting languages (see Link as an example), some prior experience programming, knowledge of C, C++ beneficial
Physics of the Atmosphere
NumberTitleTypeECTSHoursLecturers
701-0023-00LAtmosphere Information W3 credits2VE. Fischer, T. Peter
AbstractBasic principles of the atmosphere, physical structure and chemical composition, trace gases, atmospheric cycles, circulation, stability, radiation, condensation, clouds, oxidation capacity and ozone layer.
ObjectiveUnderstanding of basic physical and chemical processes in the atmosphere. Understanding of mechanisms of and interactions between: weather - climate, atmosphere - ocean - continents, troposhere - stratosphere. Understanding of environmentally relevant structures and processes on vastly differing scales. Basis for the modelling of complex interrelations in the atmospehre.
ContentBasic principles of the atmosphere, physical structure and chemical composition, trace gases, atmospheric cycles, circulation, stability, radiation, condensation, clouds, oxidation capacity and ozone layer.
Lecture notesWritten information will be supplied.
Literature- John H. Seinfeld and Spyros N. Pandis, Atmospheric Chemistry and Physics: From Air Pollution to Climate Change, Wiley, New York, 1998.
- Gösta H. Liljequist, Allgemeine Meteorologie, Vieweg, Braunschweig, 1974.
Chemistry
NumberTitleTypeECTSHoursLecturers
529-0004-01LClassical Simulation of (Bio)Molecular Systems Information
IMPORTANT NOTICE for Chemistry and Chemical and Bioengineering students: There are two different version of this course for the two regulations (2005/2018), please make sure to register for the correct version according to the regulations you are enrolled in. Please do not register for this course if you are enrolled in regulations 2005.
W6 credits4GP. H. Hünenberger
AbstractMolecular models, classical force fields, configuration sampling, molecular dynamics simulation, boundary conditions, electrostatic interactions, analysis of trajectories, free-energy calculations, structure refinement, applications in chemistry and biology. Exercises: hands-on computer exercises for learning progressively how to perform an analyze classical simulations (using the package GROMOS).
ObjectiveIntroduction to classical (atomistic) computer simulation of (bio)molecular systems, development of skills to carry out and interpret these simulations.
ContentMolecular models, classical force fields, configuration sampling, molecular dynamics simulation, boundary conditions, electrostatic interactions, analysis of trajectories, free-energy calculations, structure refinement, applications in chemistry and biology. Exercises: hands-on computer exercises for learning progressively how to perform an analyze classical simulations (using the package GROMOS).
Lecture notesScript booklet (copies of powerpoint slides) distributed at the first or second lecture.
LiteratureSee: Link
Prerequisites / NoticeSince the exercises on the computer do convey and test essentially different skills than those being conveyed during the lectures and tested at the oral exam, the results of the exercises are taken into account when evaluating the results of the exam (learning component, possible bonus of up to 0.25 points on the exam mark).

For more information about the lecture: Link
Fluid Dynamics
NumberTitleTypeECTSHoursLecturers
151-0103-00LFluid Dynamics IIW3 credits2V + 1UP. Jenny
AbstractTwo-dimensional irrotational (potential) flows: stream function and potential, singularity method, unsteady flow, aerodynamic concepts.
Vorticity dynamics: vorticity and circulation, vorticity equation, vortex theorems of Helmholtz and Kelvin.
Compressible flows: isentropic flow along stream tube, normal and oblique shocks, Laval nozzle, Prandtl-Meyer expansion, viscous effects.
ObjectiveExpand basic knowledge of fluid dynamics.
Concepts, phenomena and quantitative description of irrotational (potential), rotational, and one-dimensional compressible flows.
ContentTwo-dimensional irrotational (potential) flows: stream function and potential, complex notation, singularity method, unsteady flow, aerodynamic concepts.
Vorticity dynamics: vorticity and circulation, vorticity equation, vortex theorems of Helmholtz and Kelvin.
Compressible flows: isentropic flow along stream tube, normal and oblique shocks, Laval nozzle, Prandtl-Meyer expansion, viscous effects.
Lecture notesLecture notes are available (in German).
(See also info on literature below.)
LiteratureRelevant chapters (corresponding to lecture notes) from the textbook

P.K. Kundu, I.M. Cohen, D.R. Dowling: Fluid Mechanics, Academic Press, 5th ed., 2011 (includes a free copy of the DVD "Multimedia Fluid Mechanics")

P.K. Kundu, I.M. Cohen, D.R. Dowling: Fluid Mechanics, Academic Press, 6th ed., 2015 (does NOT include a free copy of the DVD "Multimedia Fluid Mechanics")
Prerequisites / NoticeAnalysis I/II, Knowledge of Fluid Dynamics I, thermodynamics of ideal gas
Systems and Control
NumberTitleTypeECTSHoursLecturers
227-0103-00LControl Systems Information W6 credits2V + 2UF. Dörfler
AbstractStudy of concepts and methods for the mathematical description and analysis of dynamical systems. The concept of feedback. Design of control systems for single input - single output and multivariable systems.
ObjectiveStudy of concepts and methods for the mathematical description and analysis of dynamical systems. The concept of feedback. Design of control systems for single input - single output and multivariable systems.
ContentProcess automation, concept of control. Modelling of dynamical systems - examples, state space description, linearisation, analytical/numerical solution. Laplace transform, system response for first and second order systems - effect of additional poles and zeros. Closed-loop control - idea of feedback. PID control, Ziegler - Nichols tuning. Stability, Routh-Hurwitz criterion, root locus, frequency response, Bode diagram, Bode gain/phase relationship, controller design via "loop shaping", Nyquist criterion. Feedforward compensation, cascade control. Multivariable systems (transfer matrix, state space representation), multi-loop control, problem of coupling, Relative Gain Array, decoupling, sensitivity to model uncertainty. State space representation (modal description, controllability, control canonical form, observer canonical form), state feedback, pole placement - choice of poles. Observer, observability, duality, separation principle. LQ Regulator, optimal state estimation.
LiteratureK. J. Aström & R. Murray. Feedback Systems: An Introduction for Scientists and Engineers. Princeton University Press, 2010.
R. C. Dorf and R. H. Bishop. Modern Control Systems. Prentice Hall, New Jersey, 2007.
G. F. Franklin, J. D. Powell, and A. Emami-Naeini. Feedback Control of Dynamic Systems. Addison-Wesley, 2010.
J. Lunze. Regelungstechnik 1. Springer, Berlin, 2014.
J. Lunze. Regelungstechnik 2. Springer, Berlin, 2014.
Prerequisites / NoticePrerequisites: Signal and Systems Theory II.

MATLAB is used for system analysis and simulation.
227-0045-00LSignals and Systems IW4 credits2V + 2UH. Bölcskei
AbstractSignal theory and systems theory (continuous-time and discrete-time): Signal analysis in the time and frequency domains, signal spaces, Hilbert spaces, generalized functions, linear time-invariant systems, sampling theorems, discrete-time signals and systems, digital filter structures, Discrete Fourier Transform (DFT), finite-dimensional signals and systems, Fast Fourier Transform (FFT).
ObjectiveIntroduction to mathematical signal processing and system theory.
ContentSignal theory and systems theory (continuous-time and discrete-time): Signal analysis in the time and frequency domains, signal spaces, Hilbert spaces, generalized functions, linear time-invariant systems, sampling theorems, discrete-time signals and systems, digital filter structures, Discrete Fourier Transform (DFT), finite-dimensional signals and systems, Fast Fourier Transform (FFT).
Lecture notesLecture notes, problem set with solutions.
Robotics
NumberTitleTypeECTSHoursLecturers
151-0601-00LTheory of Robotics and Mechatronics Information W4 credits3GP. Korba, S. Stoeter
AbstractThis course provides an introduction and covers the fundamentals of the field, including rigid motions, homogeneous transformations, forward and inverse kinematics of multiple degree of freedom manipulators, velocity kinematics, motion planning, trajectory generation, sensing, vision, and control.
ObjectiveRobotics is often viewed from three perspectives: perception (sensing), manipulation (affecting changes in the world), and cognition (intelligence). Robotic systems integrate aspects of all three of these areas. This course provides an introduction to the theory of robotics, and covers the fundamentals of the field, including rigid motions, homogeneous transformations, forward and inverse kinematics of multiple degree of freedom manipulators, velocity kinematics, motion planning, trajectory generation, sensing, vision, and control.
ContentAn introduction to the theory of robotics, and covers the fundamentals of the field, including rigid motions, homogeneous transformations, forward and inverse kinematics of multiple degree of freedom manipulators, velocity kinematics, motion planning, trajectory generation, sensing, vision, and control.
Lecture notesavailable.
252-0535-00LAdvanced Machine Learning Information W8 credits3V + 2U + 2AJ. M. Buhmann
AbstractMachine learning algorithms provide analytical methods to search data sets for characteristic patterns. Typical tasks include the classification of data, function fitting and clustering, with applications in image and speech analysis, bioinformatics and exploratory data analysis. This course is accompanied by practical machine learning projects.
ObjectiveStudents will be familiarized with advanced concepts and algorithms for supervised and unsupervised learning; reinforce the statistics knowledge which is indispensible to solve modeling problems under uncertainty. Key concepts are the generalization ability of algorithms and systematic approaches to modeling and regularization. Machine learning projects will provide an opportunity to test the machine learning algorithms on real world data.
ContentThe theory of fundamental machine learning concepts is presented in the lecture, and illustrated with relevant applications. Students can deepen their understanding by solving both pen-and-paper and programming exercises, where they implement and apply famous algorithms to real-world data.

Topics covered in the lecture include:

Fundamentals:
What is data?
Bayesian Learning
Computational learning theory

Supervised learning:
Ensembles: Bagging and Boosting
Max Margin methods
Neural networks

Unsupservised learning:
Dimensionality reduction techniques
Clustering
Mixture Models
Non-parametric density estimation
Learning Dynamical Systems
Lecture notesNo lecture notes, but slides will be made available on the course webpage.
LiteratureC. Bishop. Pattern Recognition and Machine Learning. Springer 2007.

R. Duda, P. Hart, and D. Stork. Pattern Classification. John Wiley &
Sons, second edition, 2001.

T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical
Learning: Data Mining, Inference and Prediction. Springer, 2001.

L. Wasserman. All of Statistics: A Concise Course in Statistical
Inference. Springer, 2004.
Prerequisites / NoticeThe course requires solid basic knowledge in analysis, statistics and numerical methods for CSE as well as practical programming experience for solving assignments.
Students should have followed at least "Introduction to Machine Learning" or an equivalent course offered by another institution.

PhD students are required to obtain a passing grade in the course (4.0 or higher based on project and exam) to gain credit points.
263-3210-00LDeep Learning Information W5 credits2V + 1U + 1AT. Hofmann
AbstractDeep learning is an area within machine learning that deals with algorithms and models that automatically induce multi-level data representations.
ObjectiveIn recent years, deep learning and deep networks have significantly improved the state-of-the-art in many application domains such as computer vision, speech recognition, and natural language processing. This class will cover the mathematical foundations of deep learning and provide insights into model design, training, and validation. The main objective is a profound understanding of why these methods work and how. There will also be a rich set of hands-on tasks and practical projects to familiarize students with this emerging technology.
Prerequisites / NoticeThis is an advanced level course that requires some basic background in machine learning. More importantly, students are expected to have a very solid mathematical foundation, including linear algebra, multivariate calculus, and probability. The course will make heavy use of mathematics and is not (!) meant to be an extended tutorial of how to train deep networks with tools like Torch or Tensorflow, although that may be a side benefit.

The participation in the course is subject to the following condition:
- Students must have taken the exam in Advanced Machine Learning (252-0535-00) or have acquired equivalent knowledge, see exhaustive list below:

Advanced Machine Learning
Link

Computational Intelligence Lab
Link

Introduction to Machine Learning
Link

Statistical Learning Theory
Link

Computational Statistics
Link

Probabilistic Artificial Intelligence
Link
263-5210-00LProbabilistic Artificial Intelligence Information Restricted registration - show details W5 credits2V + 1U + 1AA. Krause
AbstractThis course introduces core modeling techniques and algorithms from statistics, optimization, planning, and control and study applications in areas such as sensor networks, robotics, and the Internet.
ObjectiveHow can we build systems that perform well in uncertain environments and unforeseen situations? How can we develop systems that exhibit "intelligent" behavior, without prescribing explicit rules? How can we build systems that learn from experience in order to improve their performance? We will study core modeling techniques and algorithms from statistics, optimization, planning, and control and study applications in areas such as sensor networks, robotics, and the Internet. The course is designed for upper-level undergraduate and graduate students.
ContentTopics covered:
- Search (BFS, DFS, A*), constraint satisfaction and optimization
- Tutorial in logic (propositional, first-order)
- Probability
- Bayesian Networks (models, exact and approximative inference, learning) - Temporal models (Hidden Markov Models, Dynamic Bayesian Networks)
- Probabilistic palnning (MDPs, POMPDPs)
- Reinforcement learning
- Combining logic and probability
Prerequisites / NoticeSolid basic knowledge in statistics, algorithms and programming
263-5902-00LComputer Vision Information W7 credits3V + 1U + 2AM. Pollefeys, V. Ferrari, L. Van Gool
AbstractThe goal of this course is to provide students with a good understanding of computer vision and image analysis techniques. The main concepts and techniques will be studied in depth and practical algorithms and approaches will be discussed and explored through the exercises.
ObjectiveThe objectives of this course are:
1. To introduce the fundamental problems of computer vision.
2. To introduce the main concepts and techniques used to solve those.
3. To enable participants to implement solutions for reasonably complex problems.
4. To enable participants to make sense of the computer vision literature.
ContentCamera models and calibration, invariant features, Multiple-view geometry, Model fitting, Stereo Matching, Segmentation, 2D Shape matching, Shape from Silhouettes, Optical flow, Structure from motion, Tracking, Object recognition, Object category recognition
Prerequisites / NoticeIt is recommended that students have taken the Visual Computing lecture or a similar course introducing basic image processing concepts before taking this course.
151-0563-01LDynamic Programming and Optimal Control Information W4 credits2V + 1UR. D'Andrea
AbstractIntroduction to Dynamic Programming and Optimal Control.
ObjectiveCovers the fundamental concepts of Dynamic Programming & Optimal Control.
ContentDynamic Programming Algorithm; Deterministic Systems and Shortest Path Problems; Infinite Horizon Problems, Bellman Equation; Deterministic Continuous-Time Optimal Control.
LiteratureDynamic Programming and Optimal Control by Dimitri P. Bertsekas, Vol. I, 3rd edition, 2005, 558 pages, hardcover.
Prerequisites / NoticeRequirements: Knowledge of advanced calculus, introductory probability theory, and matrix-vector algebra.
151-0851-00LRobot Dynamics Information Restricted registration - show details W4 credits2V + 2UM. Hutter, R. Siegwart
AbstractWe will provide an overview on how to kinematically and dynamically model typical robotic systems such as robot arms, legged robots, rotary wing systems, or fixed wing.
ObjectiveThe primary objective of this course is that the student deepens an applied understanding of how to model the most common robotic systems. The student receives a solid background in kinematics, dynamics, and rotations of multi-body systems. On the basis of state of the art applications, he/she will learn all necessary tools to work in the field of design or control of robotic systems.
ContentThe course consists of three parts: First, we will refresh and deepen the student's knowledge in kinematics, dynamics, and rotations of multi-body systems. In this context, the learning material will build upon the courses for mechanics and dynamics available at ETH, with the particular focus on their application to robotic systems. The goal is to foster the conceptual understanding of similarities and differences among the various types of robots. In the second part, we will apply the learned material to classical robotic arms as well as legged systems and discuss kinematic constraints and interaction forces. In the third part, focus is put on modeling fixed wing aircraft, along with related design and control concepts. In this context, we also touch aerodynamics and flight mechanics to an extent typically required in robotics. The last part finally covers different helicopter types, with a focus on quadrotors and the coaxial configuration which we see today in many UAV applications. Case studies on all main topics provide the link to real applications and to the state of the art in robotics.
Prerequisites / NoticeThe contents of the following ETH Bachelor lectures or equivalent are assumed to be known: Mechanics and Dynamics, Control, Basics in Fluid Dynamics.
Physics
NumberTitleTypeECTSHoursLecturers
402-0809-00LIntroduction to Computational PhysicsW8 credits2V + 2UL. Böttcher
AbstractThis course offers an introduction to computer simulation methods for physics problems and their implementation on PCs and super computers. The covered topics include classical equations of motion, partial differential equations (wave equation, diffusion equation, Maxwell's equations), Monte Carlo simulations, percolation, phase transitions, and complex networks.
ObjectiveStudents learn to apply the following methods: Random number generators, Determination of percolation critical exponents, numerical solution of problems from classical mechanics and electrodynamics, canonical Monte-Carlo simulations to numerically analyze magnetic systems. Students also learn how to implement their own numerical frameworks and how to use existing libraries to solve physical problems. In addition, students learn to distinguish between different numerical methods to apply them to solve a given physical problem.
ContentIntroduction to computer simulation methods for physics problems. Models from classical mechanics, electrodynamics and statistical mechanics as well as some interdisciplinary applications are used to introduce the most important object-oriented programming methods for numerical simulations (typically in C++). Furthermore, an overview of existing software libraries for numerical simulations is presented.
Lecture notesLecture notes and slides are available online and will be distributed if desired.
LiteratureLiterature recommendations and references are included in the lecture notes.
Prerequisites / NoticeLecture and exercise lessons in english, exams in German or in English
Computational Finance
NumberTitleTypeECTSHoursLecturers
401-3913-01LMathematical Foundations for Finance Information W4 credits3V + 2UE. W. Farkas
AbstractFirst introduction to main modelling ideas and mathematical tools from mathematical finance
ObjectiveThis course gives a first introduction to the main modelling ideas and mathematical tools from mathematical finance. It mainly aims at non-mathematicians who need an introduction to the main tools from stochastics used in mathematical finance. However, mathematicians who want to learn some basic modelling ideas and concepts for quantitative finance (before continuing with a more advanced course) may also find this of interest.. The main emphasis will be on ideas, but important results will be given with (sometimes partial) proofs.
ContentTopics to be covered include

- financial market models in finite discrete time
- absence of arbitrage and martingale measures
- valuation and hedging in complete markets
- basics about Brownian motion
- stochastic integration
- stochastic calculus: Itô's formula, Girsanov transformation, Itô's representation theorem
- Black-Scholes formula
Lecture notesLecture notes will be sold at the beginning of the course.
LiteratureLecture notes will be sold at the beginning of the course. Additional (background) references are given there.
Prerequisites / NoticePrerequisites: Results and facts from probability theory as in the book "Probability Essentials" by J. Jacod and P. Protter will be used freely. Especially participants without a direct mathematics background are strongly advised to familiarise themselves with those tools before (or very quickly during) the course. (A possible alternative to the above English textbook are the (German) lecture notes for the standard course "Wahrscheinlichkeitstheorie".)

For those who are not sure about their background, we suggest to look at the exercises in Chapters 8, 9, 22-25, 28 of the Jacod/Protter book. If these pose problems, you will have a hard time during the course. So be prepared.
401-4657-00LNumerical Analysis of Stochastic Ordinary Differential Equations Information
Alternative course title: "Computational Methods for Quantitative Finance: Monte Carlo and Sampling Methods"
W6 credits3V + 1UK. Kirchner
AbstractCourse on numerical approximations of stochastic ordinary differential equations driven by Wiener processes. These equations have several applications, for example in financial option valuation. This course also contains an introduction to random number generation and Monte Carlo methods for random variables.
ObjectiveThe aim of this course is to enable the students to carry out simulations and their mathematical convergence analysis for stochastic models originating from applications such as mathematical finance. For this the course teaches a decent knowledge of the different numerical methods, their underlying ideas, convergence properties and implementation issues.
ContentGeneration of random numbers
Monte Carlo methods for the numerical integration of random variables
Stochastic processes and Brownian motion
Stochastic ordinary differential equations (SODEs)
Numerical approximations of SODEs
Applications to computational finance: Option valuation
Lecture notesThere will be English, typed lecture notes for registered participants in the course.
LiteratureP. Glassermann:
Monte Carlo Methods in Financial Engineering.
Springer-Verlag, New York, 2004.

P. E. Kloeden and E. Platen:
Numerical Solution of Stochastic Differential Equations.
Springer-Verlag, Berlin, 1992.
Prerequisites / NoticePrerequisites:

Mandatory: Probability and measure theory,
basic numerical analysis and
basics of MATLAB programming.

a) mandatory courses:
Elementary Probability,
Probability Theory I.

b) recommended courses:
Stochastic Processes.

Start of lectures: Wednesday, September 18, 2019.
Electromagnetics
NumberTitleTypeECTSHoursLecturers
227-2037-00LPhysical Modelling and SimulationW6 credits4GJ. Smajic
AbstractThis module consists of (a) an introduction to fundamental equations of electromagnetics, mechanics and heat transfer, (b) a detailed overview of numerical methods for field simulations, and (c) practical examples solved in form of small projects.
ObjectiveBasic knowledge of the fundamental equations and effects of electromagnetics, mechanics, and heat transfer. Knowledge of the main concepts of numerical methods for physical modelling and simulation. Ability (a) to develop own simple field simulation programs, (b) to select an appropriate field solver for a given problem, (c) to perform field simulations, (d) to evaluate the obtained results, and (e) to interactively improve the models until sufficiently accurate results are obtained.
ContentThe module begins with an introduction to the fundamental equations and effects of electromagnetics, mechanics, and heat transfer. After the introduction follows a detailed overview of the available numerical methods for solving electromagnetic, thermal and mechanical boundary value problems. This part of the course contains a general introduction into numerical methods, differential and integral forms, linear equation systems, Finite Difference Method (FDM), Boundary Element Method (BEM), Method of Moments (MoM), Multiple Multipole Program (MMP) and Finite Element Method (FEM). The theoretical part of the course finishes with a presentation of multiphysics simulations through several practical examples of HF-engineering such as coupled electromagnetic-mechanical and electromagnetic-thermal analysis of MEMS.
In the second part of the course the students will work in small groups on practical simulation problems. For solving practical problems the students can develop and use own simulation programs or chose an appropriate commercial field solver for their specific problem. This practical simulation work of the students is supervised by the lecturers.
Geophysics
Recommended combinations:
Subject 1 + Subject 2
Subject 1 + Subject 3
Subject 2 + Subject 3
Subject 3 + Subject 4
Subject 5 + Subject 6
Subject 5 + Subject 4
Geophysics: Subject 1
NumberTitleTypeECTSHoursLecturers
651-4007-00LContinuum MechanicsW3 credits2VT. Gerya
AbstractIn this course, students learn crucial partial differential equations (conservation laws) that are applicable to any continuum including the Earth's mantle, core, atmosphere and ocean. The course will provide step-by-step introduction into the mathematical structure, physical meaning and analytical solutions of the equations. The course has a particular focus on solid Earth applications.
ObjectiveThe goal of this course is to learn and understand few principal partial differential equations (conservation laws) that are applicable for analysing and modelling of any continuum including the Earth's mantle, core, atmosphere and ocean. By the end of the course, students should be able to write, explain and analyse the equations and apply them for simple analytical cases. Numerical solving of these equations will be discussed in the Numerical Modelling I and II course running in parallel.
ContentA provisional week-by-week schedule (subject to change) is as follows:


Week 1: The continuity equation
Theory: Definition of a geological media as a continuum. Field variables used for the representation of a continuum.Methods for definition of the field variables. Eulerian and Lagrangian points of view. Continuity equation in Eulerian and Lagrangian forms and their derivation. Advective transport term. Continuity equation for an incompressible fluid.
Exercise: Computing the divergence of velocity field.

Week 2: Density and gravity
Theory: Density of rocks and minerals. Thermal expansion and compressibility. Dependence of density on pressure and temperature. Equations of state. Poisson equation for gravitational potential and its derivation.
Exercise: Computing density, thermal expansion and compressibility from an equation of state.

Week 3: Stress and strain
Theory: Deformation and stresses. Definition of stress, strain and strain-rate tensors. Deviatoric stresses. Mean stress as a dynamic (nonlithostatic) pressure. Stress and strain rate invariants.
Exercise: Analysing strain rate tensor for solid body rotation.

Week 4: The momentum equation
Theory: Momentum equation. Viscosity and Newtonian law of viscous friction. Navier-–Stokes equation for the motion of a viscous fluid. Stokes equation of slow laminar flow of highly viscous incompressible fluid and its application to geodynamics. Simplification of the Stokes equation in case of constant viscosity and its relation to the Poisson equation. Exercises: Computing velocity for magma flow in a channel.

Week 5: Viscous rheology of rocks
Theory: Solid-state creep of minerals and rocks as themajor mechanism of deformation of the Earth’s interior. Dislocation and diffusion creep mechanisms. Rheological equations for minerals and rocks. Effective viscosity and its dependence on temperature, pressure and strain rate. Formulation of the effective viscosity from empirical flow laws.
Exercise: Deriving viscous rheological equations for computing effective viscosities from empirical flow laws.

Week 6: The heat conservation equation
Theory: Fourier’s law of heat conduction. Heat conservation equation and its derivation. Radioactive, viscous and adiabatic heating and their relative importance. Heat conservation equation for the case of a constant thermal conductivity and its relation to the Poisson equation.
Exercise: steady temperature profile in case of channel flow.

Week 7: Elasticity and plasticity
Theory: Elastic rheology. Maxwell viscoelastic rheology. Plastic rheology. Plastic yielding criterion. Plastic flow potential. Plastic flow rule.



GRADING will be based on honeworks (30%) and oral exams (70%).
Exam questions: Link
Lecture notesScript is available by request to Link
Exam questions: Link
LiteratureTaras Gerya Introduction to Numerical Geodynamic Modelling Cambridge University Press, 2010
Geophysics: Subject 2
NumberTitleTypeECTSHoursLecturers
651-4241-00LNumerical Modelling I and II: Theory and ApplicationsW6 credits4GT. Gerya
AbstractIn this 13-week sequence, students learn how to write programs from scratch to solve partial differential equations that are useful for Earth science applications. Programming will be done in MATLAB and will use the finite-difference method and marker-in-cell technique. The course will emphasise a hands-on learning approach rather than extensive theory.
ObjectiveThe goal of this course is for students to learn how to program numerical applications from scratch. By the end of the course, students should be able to write state-of-the-art MATLAB codes that solve systems of partial-differential equations relevant to Earth and Planetary Science applications using finite-difference method and marker-in-cell technique. Applications include Poisson equation, buoyancy driven variable viscosity flow, heat diffusion and advection, and state-of-the-art thermomechanical code programming. The emphasis will be on commonality, i.e., using a similar approach to solve different applications, and modularity, i.e., re-use of code in different programs. The course will emphasise a hands-on learning approach rather than extensive theory, and will begin with an introduction to programming in MATLAB.
ContentA provisional week-by-week schedule (subject to change) is as follows:

Week 1: Introduction to the finite difference approximation to differential equations. Introduction to programming in Matlab. Solving of 1D Poisson equation.
Week 2: Direct and iterative methods for obtaining numerical solutions. Solving of 2D Poisson equation with direct method. Solving of 2D Poisson equation with Gauss-Seidel and Jacobi iterative methods.
Week 3: Solving momentum and continuity equations in case of constant viscosity with stream function/vorticity formulation.
Weeks 4: Staggered grid for formulating momentum and continuity equations. Indexing of unknowns. Solving momentum and continuity equations in case of constant viscosity using pressure-velocity formulation with staggered grid.
Weeks 5: Conservative finite differences for the momentum equation. "Free slip" and "no slip" boundary conditions. Solving momentum and continuity equations in case of variable viscosity using pressure-velocity formulation with staggered grid.
Week 6: Advection in 1-D. Eulerian methods. Marker-in-cell method. Comparison of different advection methods and their accuracy.
Week 7: Advection in 2-D with Marker-in-cell method. Combining flow calculation and advection for buoyancy driven flow.
Week 8: "Free surface" boundary condition and "sticky air" approach. Free surface stabilization. Runge-Kutta schemes.
Week 9: Solving 2D heat conservation equation in case of constant thermal conductivity with explicit and implicit approaches.
Week 10: Solving 2D heat conservation equation in case of variable thermal conductivity with implicit approach. Temperature advection with markers. Creating thermomechanical code by combining mechanical solution for 2D buoyancy driven flow with heat diffusion and advection based on marker-in-cell approach.
Week 11: Subgrid diffusion of temperature. Implementing subgrid diffusion to the thermomechanical code.
Week 12: Implementation of radioactive, adiabatic and shear heating to the thermomechanical code.
Week 13: Implementation of temperature-, pressure- and strain rate-dependent viscosity, temperature- and pressure-dependent density and temperature-dependent thermal conductivity to the thermomechanical code. Final project description.


GRADING will be based on weekly programming homeworks (50%) and a term project (50%) to develop an application of their choice to a more advanced level.
LiteratureTaras Gerya, Introduction to Numerical Geodynamic Modelling, Cambridge University Press 2010
Geophysics: Subject 3
Offered in the spring semester
Geophysics: Subject 4
Offered in the spring semester
Geophysics: Subject 5
NumberTitleTypeECTSHoursLecturers
651-4014-00LSeismic Tomography
Does not take place this semester.
W3 credits2G
AbstractSeismic tomography is the science of interpreting seismic measurements (seismograms) to derive information about the structure of the Earth. The subject of this course is the formal relationship existing between a seismic measurement and the nature of the Earth, or of certain regions of the Earth, and the ways to use it, to gain information about the Earth.
Objective
LiteratureAki, K. and P. G. Richards, Quantitative Seismology, second edition, University Science Books, Sausalito, 2002. The most standard textbook in seismology, for grad students and advanced undergraduates.
Dahlen, F. A. and J. Tromp, Theoretical Global Seismology, Princeton University Press, Princeton, 1998. A very good book, suited for advanced graduate students with a strong math background.
Kennett B.L.N., The Seismic Wavefield. Volume I: Introduction and Theoretical Development (2001). Volume II: Interpretation of Seismograms on Regional and Global Scales (2002). Cambridge University Press.
Lay, T. and T. C. Wallace, Modern Global Seismology, Academic Press, San Diego, 1995. A very basic seismology textbook. Chapters 2 through 4 provide a useful introduction to the contents of this course.
Menke, W., Geophysical Data Analysis: Discrete Inverse Theory, revised edition, Academic Press, San Diego, 1989. A very complete textbook on inverse theory in geophysics.
Press, W. H., S. A. Teukolsky, W. T. Vetterling and B. P. Flannery, Numerical Recipes, Cambridge University Press. The art of scientific computing.
Trefethen, L. N. and D. Bau III, Numerical Linear Algebra, Soc. for Ind. and Appl. Math., Philadelphia, 1997. A textbook on the numerical solution of large linear inverse problems, designed for advanced math undergraduates.
Geophysics: Subject 6
Offered in the spring semester
Biology
NumberTitleTypeECTSHoursLecturers
636-0007-00LComputational Systems Biology Information W6 credits3V + 2UJ. Stelling
AbstractStudy of fundamental concepts, models and computational methods for the analysis of complex biological networks. Topics: Systems approaches in biology, biology and reaction network fundamentals, modeling and simulation approaches (topological, probabilistic, stoichiometric, qualitative, linear / nonlinear ODEs, stochastic), and systems analysis (complexity reduction, stability, identification).
ObjectiveThe aim of this course is to provide an introductory overview of mathematical and computational methods for the modeling, simulation and analysis of biological networks.
ContentBiology has witnessed an unprecedented increase in experimental data and, correspondingly, an increased need for computational methods to analyze this data. The explosion of sequenced genomes, and subsequently, of bioinformatics methods for the storage, analysis and comparison of genetic sequences provides a prominent example. Recently, however, an additional area of research, captured by the label "Systems Biology", focuses on how networks, which are more than the mere sum of their parts' properties, establish biological functions. This is essentially a task of reverse engineering. The aim of this course is to provide an introductory overview of corresponding computational methods for the modeling, simulation and analysis of biological networks. We will start with an introduction into the basic units, functions and design principles that are relevant for biology at the level of individual cells. Making extensive use of example systems, the course will then focus on methods and algorithms that allow for the investigation of biological networks with increasing detail. These include (i) graph theoretical approaches for revealing large-scale network organization, (ii) probabilistic (Bayesian) network representations, (iii) structural network analysis based on reaction stoichiometries, (iv) qualitative methods for dynamic modeling and simulation (Boolean and piece-wise linear approaches), (v) mechanistic modeling using ordinary differential equations (ODEs) and finally (vi) stochastic simulation methods.
Lecture notesLink
LiteratureU. Alon, An introduction to systems biology. Chapman & Hall / CRC, 2006.

Z. Szallasi et al. (eds.), System modeling in cellular biology. MIT Press, 2010.

B. Ingalls, Mathematical modeling in systems biology: an introduction. MIT Press, 2013
636-0706-00LSpatio-Temporal Modelling in Biology Information W4 credits3GD. Iber
AbstractThis course focuses on modeling spatio-temporal problems in biology, in particular on the cell and tissue level. The main focus is on mechanisms and concepts, but mathematical and numerical techniques are introduced as required. Biological examples discussed in the course provide an introduction to key concepts in developmental biology.
ObjectiveStudents will learn state-of-the-art approaches to modelling spatial effects in dynamical biological systems. The course provides an introduction to dynamical system, and covers the mathematical analysis of pattern formation in growing, developing systems, as well as the description of mechanical effects at the cell and tissue level. The course also provides an introduction to image-based modelling, i.e. the use of microscopy data for model development and testing. The course covers classic as well as current approaches and exposes students to open problems in the field. In this way, the course seeks to prepare students to conduct research in the field. The course prepares students for research in developmental biology, as well as for applications in tissue engineering, and for biomedical research.
Content1. Introduction to Modelling in Biology
2. Morphogen Gradients
3. Dynamical Systems
4. Cell-cell Signalling (Dr Boareto)
5. Travelling Waves
6. Turing Patterns
7. Chemotaxis
8. Mathematical Description of Growing Biological Systems
9. Image-Based Modelling
10. Tissue Mechanics
11. Cell-based Tissue Simulation Frameworks
12. Plant Development (Dr Dumont)
13. Growth Control
14. Summary
Lecture notesAll lecture material will be made available online
Link
LiteratureThe lecture course is not based on any textbook. The following textbooks are related to some of its content. The textbooks may be of interest for further reading, but are not necessary to follow the course:

Murray, Mathematical Biology, Springer
Forgacs and Newman, Biological Physics of the Developing Embryo, CUP
Keener and Sneyd, Mathematical Physiology, Springer
Fall et al, Computational Cell Biology, Springer
Szallasi et al, System Modeling in Cellular Biology, MIT Press
Wolkenhauer, Systems Biology
Kreyszig, Engineering Mathematics, Wiley
Prerequisites / NoticeThe course is self-contained. The course assumes no background in biology but a good foundation regarding mathematical and computational techniques.
Electives
In the ‘electives’ subcategory, at least two course units must be successfully completed.
NumberTitleTypeECTSHoursLecturers
151-0709-00LStochastic Methods for Engineers and Natural Scientists Restricted registration - show details
Number of participants limited to 45.
W4 credits3GD. W. Meyer-Massetti
AbstractThe course provides an introduction into stochastic methods that are applicable for example for the description and modeling of turbulent and subsurface flows. Moreover, mathematical techniques are presented that are used to quantify uncertainty in various engineering applications.
ObjectiveBy the end of the course you should be able to mathematically describe random quantities and their effect on physical systems. Moreover, you should be able to develop basic stochastic models of such systems.
Content- Probability theory, single and multiple random variables, mappings of random variables
- Estimation of statistical moments and probability densities based on data
- Stochastic differential equations, Ito calculus, PDF evolution equations
- Polynomial chaos and other expansion methods
All topics are illustrated with engineering applications.
Lecture notesDetailed lecture notes will be provided.
LiteratureSome textbooks related to the material covered in the course:
Stochastic Methods: A Handbook for the Natural and Social Sciences, Crispin Gardiner, Springer, 2010
The Fokker-Planck Equation: Methods of Solutions and Applications, Hannes Risken, Springer, 1996
Turbulent Flows, S.B. Pope, Cambridge University Press, 2000
Spectral Methods for Uncertainty Quantification, O.P. Le Maitre and O.M. Knio, Springer, 2010
151-0317-00LVisualization, Simulation and Interaction - Virtual Reality IIW4 credits3GA. Kunz
AbstractThis lecture provides deeper knowledge on the possible applications of virtual reality, its basic technolgy, and future research fields. The goal is to provide a strong knowledge on Virtual Reality for a possible future use in business processes.
ObjectiveVirtual Reality can not only be used for the visualization of 3D objects, but also offers a wide application field for small and medium enterprises (SME). This could be for instance an enabling technolgy for net-based collaboration, the transmission of images and other data, the interaction of the human user with the digital environment, or the use of augmented reality systems.
The goal of the lecture is to provide a deeper knowledge of today's VR environments that are used in business processes. The technical background, the algorithms, and the applied methods are explained more in detail. Finally, future tasks of VR will be discussed and an outlook on ongoing international research is given.
ContentIntroduction into Virtual Reality; basisc of augmented reality; interaction with digital data, tangible user interfaces (TUI); basics of simulation; compression procedures of image-, audio-, and video signals; new materials for force feedback devices; intorduction into data security; cryptography; definition of free-form surfaces; digital factory; new research fields of virtual reality
Lecture notesThe handout is available in German and English.
Prerequisites / NoticePrerequisites:
"Visualization, Simulation and Interaction - Virtual Reality I" is recommended, but not mandatory.

Didactical concept:
The course consists of lectures and exercises.
151-0833-00LPrinciples of Nonlinear Finite-Element-MethodsW5 credits2V + 2UN. Manopulo, B. Berisha
AbstractMost problems in engineering are of nonlinear nature. The nonlinearities are caused basically due to the nonlinear material behavior, contact conditions and instability of structures. The principles of the nonlinear Finite-Element-Method (FEM) will be introduced in the scope of this lecture for treating such problems.
ObjectiveThe goal of the lecture is to provide the students with the fundamentals of the non linear Finite Element Method (FEM). The lecture focuses on the principles of the nonlinear Finite-Element-Method based on explicit and implicit formulations. Typical applications of the nonlinear Finite-Element-Methods are simulations of:

- Crash
- Collapse of structures
- Materials in Biomechanics (soft materials)
- General forming processes

Special attention will be paid to the modeling of the nonlinear material behavior, thermo-mechanical processes and processes with large plastic deformations. The ability to independently create a virtual model which describes the complex non linear systems will be acquired through accompanying exercises. These will include the Matlab programming of important model components such as constitutive equations
Content- Fundamentals of continuum mechanics to characterize large plastic deformations
- Elasto-plastic material models
- Updated-Lagrange (UL), Euler and combined Euler-Lagrange (ALE) approaches
- FEM implementation of constitutive equations
- Element formulations
- Implicit and explicit FEM methods
- FEM formulations of coupled thermo-mechanical problems
- Modeling of tool contact and the influence of friction
- Solvers and convergence
- Modeling of crack propagation
- Introduction of advanced FE-Methods
Lecture notesyes
LiteratureBathe, K. J., Finite-Element-Procedures, Prentice-Hall, 1996
Prerequisites / NoticeIf we will have a large number of students, two dates for the exercises will be offered.
263-2800-00LDesign of Parallel and High-Performance Computing Information Restricted registration - show details W8 credits3V + 2U + 2AM. Püschel, T. Ben Nun
AbstractAdvanced topics in parallel / concurrent programming.
ObjectiveUnderstand concurrency paradigms and models from a higher perspective and acquire skills for designing, structuring and developing possibly large concurrent software systems. Become able to distinguish parallelism in problem space and in machine space. Become familiar with important technical concepts and with concurrency folklore.
227-0102-00LDiscrete Event Systems Information W6 credits4GL. Thiele, L. Vanbever, R. Wattenhofer
AbstractIntroduction to discrete event systems. We start out by studying popular models of discrete event systems. In the second part of the course we analyze discrete event systems from an average-case and from a worst-case perspective. Topics include: Automata and Languages, Specification Models, Stochastic Discrete Event Systems, Worst-Case Event Systems, Verification, Network Calculus.
ObjectiveOver the past few decades the rapid evolution of computing, communication, and information technologies has brought about the proliferation of new dynamic systems. A significant part of activity in these systems is governed by operational rules designed by humans. The dynamics of these systems are characterized by asynchronous occurrences of discrete events, some controlled (e.g. hitting a keyboard key, sending a message), some not (e.g. spontaneous failure, packet loss).

The mathematical arsenal centered around differential equations that has been employed in systems engineering to model and study processes governed by the laws of nature is often inadequate or inappropriate for discrete event systems. The challenge is to develop new modeling frameworks, analysis techniques, design tools, testing methods, and optimization processes for this new generation of systems.

In this lecture we give an introduction to discrete event systems. We start out the course by studying popular models of discrete event systems, such as automata and Petri nets. In the second part of the course we analyze discrete event systems. We first examine discrete event systems from an average-case perspective: we model discrete events as stochastic processes, and then apply Markov chains and queuing theory for an understanding of the typical behavior of a system. In the last part of the course we analyze discrete event systems from a worst-case perspective using the theory of online algorithms and adversarial queuing.
Content1. Introduction
2. Automata and Languages
3. Smarter Automata
4. Specification Models
5. Stochastic Discrete Event Systems
6. Worst-Case Event Systems
7. Network Calculus
Lecture notesAvailable
Literature[bertsekas] Data Networks
Dimitri Bersekas, Robert Gallager
Prentice Hall, 1991, ISBN: 0132009161

[borodin] Online Computation and Competitive Analysis
Allan Borodin, Ran El-Yaniv.
Cambridge University Press, 1998

[boudec] Network Calculus
J.-Y. Le Boudec, P. Thiran
Springer, 2001

[cassandras] Introduction to Discrete Event Systems
Christos Cassandras, Stéphane Lafortune.
Kluwer Academic Publishers, 1999, ISBN 0-7923-8609-4

[fiat] Online Algorithms: The State of the Art
A. Fiat and G. Woeginger

[hochbaum] Approximation Algorithms for NP-hard Problems (Chapter 13 by S. Irani, A. Karlin)
D. Hochbaum

[schickinger] Diskrete Strukturen (Band 2: Wahrscheinlichkeitstheorie und Statistik)
T. Schickinger, A. Steger
Springer, Berlin, 2001

[sipser] Introduction to the Theory of Computation
Michael Sipser.
PWS Publishing Company, 1996, ISBN 053494728X
227-0116-00LVLSI I: From Architectures to VLSI Circuits and FPGAs Information W6 credits5GF. K. Gürkaynak, L. Benini
AbstractThis first course in a series that extends over three consecutive terms is concerned with tailoring algorithms and with devising high performance hardware architectures for their implementation as ASIC or with FPGAs. The focus is on front end design using HDLs and automatic synthesis for producing industrial-quality circuits.
ObjectiveUnderstand Very-Large-Scale Integrated Circuits (VLSI chips), Application-Specific Integrated Circuits (ASIC), and Field-Programmable Gate-Arrays (FPGA). Know their organization and be able to identify suitable application areas. Become fluent in front-end design from architectural conception to gate-level netlists. How to model digital circuits with SystemVerilog. How to ensure they behave as expected with the aid of simulation, testbenches, and assertions. How to take advantage of automatic synthesis tools to produce industrial-quality VLSI and FPGA circuits. Gain practical experience with the hardware description language SystemVerilog and with industrial Electronic Design Automation (EDA) tools.
ContentThis course is concerned with system-level issues of VLSI design and FPGA implementations. Topics include:
- Overview on design methodologies and fabrication depths.
- Levels of abstraction for circuit modeling.
- Organization and configuration of commercial field-programmable components.
- FPGA design flows.
- Dedicated and general purpose architectures compared.
- How to obtain an architecture for a given processing algorithm.
- Meeting throughput, area, and power goals by way of architectural transformations.
- Hardware Description Languages (HDL) and the underlying concepts.
- SystemVerilog
- Register Transfer Level (RTL) synthesis and its limitations.
- Building blocks of digital VLSI circuits.
- Functional verification techniques and their limitations.
- Modular and largely reusable testbenches.
- Assertion-based verification.
- Synchronous versus asynchronous circuits.
- The case for synchronous circuits.
- Periodic events and the Anceau diagram.
- Case studies, ASICs compared to microprocessors, DSPs, and FPGAs.

During the exercises, students learn how to model FPGAs with SystemVerilog. They write testbenches for simulation purposes and synthesize gate-level netlists for FPGAs. Commercial EDA software by leading vendors is being used throughout.
Lecture notesTextbook and all further documents in English.
LiteratureH. Kaeslin: "Top-Down Digital VLSI Design, from Architectures to Gate-Level Circuits and FPGAs", Elsevier, 2014, ISBN 9780128007303.
Prerequisites / NoticePrerequisites:
Basics of digital circuits.

Examination:
In written form following the course semester (spring term). Problems are given in English, answers will be accepted in either English oder German.

Further details:
Link
227-0148-00LVLSI III: Test and Fabrication of VLSI Circuits Information W6 credits4GF. K. Gürkaynak, L. Benini
AbstractIn this course, we will cover how modern microchips are fabricated, and we will focus on methods and tools to uncover fabrication defects, if any, in these microchips. As part of the exercises, students will get to work on an industrial 1 million dollar automated test equipment.
ObjectiveLearn about modern IC manufacturing methodologies, understand the problem of IC testing. Cover the basic methods, algorithms and techniques to test circuits in an efficient way. Learn about practical aspects of IC testing and apply what you learn in class using a state-of-the art tester.
ContentIn this course we will deal with modern integrated circuit (IC) manufacturing technology and cover topics such as:
- Today's nanometer CMOS fabrication processes (HKMG).
- Optical and post optical Photolithography.
- Potential alternatives to CMOS technology and MOSFET devices.
- Evolution paths for design methodology.
- Industrial roadmaps for the future evolution of semiconductor technology (ITRS).

If you want to earn money by selling ICs, you will have to deliver a product that will function properly with a very large probability. The main emphasis of the lecture will be discussing how this can be achieved. We will discuss fault models and practical techniques to improve testability of VLSI circuits. At the IIS we have a state-of-the-art automated test equipment (Advantest SoC V93000) that we will make available for in class exercises and projects. At the end of the lecture you will be able to design state-of-the art digital integrated circuits such as to make them testable and to use automatic test equipment (ATE) to carry out the actual testing.

During the first weeks of the course there will be weekly practical exercises where you will work in groups of two. For the last 5 weeks of the class students will be able to choose a class project that can be:
- The test of their own chip developed during a previous semester thesis
- Developing new setups and measurement methods in C++ on the tester
- Helping to debug problems encountered in previous microchips by IIS.

Half of the oral exam will consist of a short presentation on this class project.
Lecture notesMain course book: "Essentials of Electronic Testing for Digital, Memory and Mixed-Signal VLSI Circuits" by Michael L. Bushnell and Vishwani D. Agrawal, Springer, 2004. This book is available online within ETH through
Link
Prerequisites / NoticeAlthough this is the third part in a series of lectures on VLSI design, you can follow this course even if you have not visited VLSI I and VLSI II lectures. An interest in integrated circuit design, and basic digital circuit knowledge is required though.

Course website:
Link
227-0158-00LSemiconductor Devices: Transport Theory and Monte Carlo Simulation Information W4 credits2GF. Bufler
AbstractThe lecture combines quasi-ballistic transport theory with application to realistic devices
of current and future CMOS technology.
All aspects such as quantum mechanics, phonon scattering or Monte Carlo techniques to
solve the Boltzmann equation are introduced. In the exercises advanced devices such
as FinFETs and nanosheets are simulated.
ObjectiveThe aim of the course is a fundamental understanding of the derivation of the Boltzmann
equation and its solution by Monte Carlo methods. The practical aspect is to become
familiar with technology computer-aided design (TCAD) and perform simulations of
advanced CMOS devices.
ContentThe covered topics include:
- quantum mechanics and second quantization,
- band structure calculation including the pseudopotential method
- phonons
- derivation of the Boltzmann equation including scattering in the Markov limit
- stochastic Monte Carlo techniques to solve the Boltzmann equation
- TCAD environment and geometry generation
- Stationary bulk Monte Carlo simulation of velocity-field curves
- Transient Monte Carlo simulation for quasi-ballistic velocity overshoot
- Monte Carlo device simulation of FinFETs and nanosheets
Lecture notesLecture notes (in German)
LiteratureFurther reading will be recommended in the lecture.
Prerequisites / NoticeKnowledge of quantum mechanics is not required. Basic knowledge of semiconductor
physics is useful, but not necessary.
227-0447-00LImage Analysis and Computer Vision Information W6 credits3V + 1UL. Van Gool, O. Göksel, E. Konukoglu
AbstractLight and perception. Digital image formation. Image enhancement and feature extraction. Unitary transformations. Color and texture. Image segmentation. Motion extraction and tracking. 3D data extraction. Invariant features. Specific object recognition and object class recognition. Deep learning and Convolutional Neural Networks.
ObjectiveOverview of the most important concepts of image formation, perception and analysis, and Computer Vision. Gaining own experience through practical computer and programming exercises.
ContentThis course aims at offering a self-contained account of computer vision and its underlying concepts, including the recent use of deep learning.
The first part starts with an overview of existing and emerging applications that need computer vision. It shows that the realm of image processing is no longer restricted to the factory floor, but is entering several fields of our daily life. First the interaction of light with matter is considered. The most important hardware components such as cameras and illumination sources are also discussed. The course then turns to image discretization, necessary to process images by computer.
The next part describes necessary pre-processing steps, that enhance image quality and/or detect specific features. Linear and non-linear filters are introduced for that purpose. The course will continue by analyzing procedures allowing to extract additional types of basic information from multiple images, with motion and 3D shape as two important examples. Finally, approaches for the recognition of specific objects as well as object classes will be discussed and analyzed. A major part at the end is devoted to deep learning and AI-based approaches to image analysis. Its main focus is on object recognition, but also other examples of image processing using deep neural nets are given.
Lecture notesCourse material Script, computer demonstrations, exercises and problem solutions
Prerequisites / NoticePrerequisites:
Basic concepts of mathematical analysis and linear algebra. The computer exercises are based on Python and Linux.
The course language is English.
227-0417-00LInformation Theory IW6 credits4GA. Lapidoth
AbstractThis course covers the basic concepts of information theory and of communication theory. Topics covered include the entropy rate of a source, mutual information, typical sequences, the asymptotic equi-partition property, Huffman coding, channel capacity, the channel coding theorem, the source-channel separation theorem, and feedback capacity.
ObjectiveThe fundamentals of Information Theory including Shannon's source coding and channel coding theorems
ContentThe entropy rate of a source, Typical sequences, the asymptotic equi-partition property, the source coding theorem, Huffman coding, Arithmetic coding, channel capacity, the channel coding theorem, the source-channel separation theorem, feedback capacity
LiteratureT.M. Cover and J. Thomas, Elements of Information Theory (second edition)
227-0427-00LSignal Analysis, Models, and Machine LearningW6 credits4GH.‑A. Loeliger
AbstractMathematical methods in signal processing and machine learning.
I. Linear signal representation and approximation: Hilbert spaces, LMMSE estimation, regularization and sparsity.
II. Learning linear and nonlinear functions and filters: neural networks, kernel methods.
III. Structured statistical models: hidden Markov models, factor graphs, Kalman filter, Gaussian models with sparse events.
ObjectiveThe course is an introduction to some basic topics in signal processing and machine learning.
ContentPart I - Linear Signal Representation and Approximation: Hilbert spaces, least squares and LMMSE estimation, projection and estimation by linear filtering, learning linear functions and filters, L2 regularization, L1 regularization and sparsity, singular-value decomposition and pseudo-inverse, principal-components analysis.
Part II - Learning Nonlinear Functions: fundamentals of learning, neural networks, kernel methods.
Part III - Structured Statistical Models and Message Passing Algorithms: hidden Markov models, factor graphs, Gaussian message passing, Kalman filter and recursive least squares, Monte Carlo methods, parameter estimation, expectation maximization, linear Gaussian models with sparse events.
Lecture notesLecture notes.
Prerequisites / NoticePrerequisites:
- local bachelors: course "Discrete-Time and Statistical Signal Processing" (5. Sem.)
- others: solid basics in linear algebra and probability theory
227-0627-00LApplied Computer ArchitectureW6 credits4GA. Gunzinger
AbstractThis lecture gives an overview of the requirements and the architecture of parallel computer systems, performance, reliability and costs.
ObjectiveUnderstand the function, the design and the performance modeling of parallel computer systems.
ContentThe lecture "Applied Computer Architecture" gives technical and corporate insights in innovative Computer Systems/Architectures (CPU, GPU, FPGA, dedicated processors) and their real implementations and applications. Often the designs have to deal with technical limits.
Which computer architecture allows the control of the over 1000 magnets at the Swiss Light Source (SLS)?
Which architecture is behind the alarm center of the Swiss Railway (SBB)?
Which computer architectures are applied for driver assistance systems?
Which computer architecture is hidden behind a professional digital audio mixing desk?
How can data streams of about 30 TB/s, produced by a protone accelerator, be processed in real time?
Can the weather forecast also be processed with GPUs?
How can a good computer architecture be found?
Which are the driving factors in succesful computer architecture design?
Lecture notesScript and exercices sheets.
Prerequisites / NoticePrerequisites:
Basics of computer architecture.
227-0971-00LComputational Psychiatry Information
Please note that participation in this course and the practical sessions requires additional registration until 23 August 2019 at: Link
W3 credits4SK. Stephan
AbstractThis five-day course teaches state-of-the-art methods in computational psychiatry. It covers various computational models of cognition (e.g., learning and decision-making) and brain physiology (e.g., effective connectivity) of relevance for psychiatric disorders. The course not only provides theoretical background, but also demonstrates open source software in application to concrete examples.
ObjectiveThis course aims at bridging the gap between mathematical modelers and clinical neuroscientists by teaching computational techniques in the context of clinical applications. The hope is that the acquisition of a joint language and tool-kit will enable more effective communication and joint translational research between fields that are usually worlds apart.
ContentThis five-day course teaches state-of-the-art methods in computational psychiatry. It covers various computational models of cognition (e.g., learning and decision-making) and brain physiology (e.g., effective connectivity) of relevance for psychiatric disorders. The course not only provides theoretical background, but also demonstrates open source software in application to concrete examples.
252-0417-00LRandomized Algorithms and Probabilistic MethodsW8 credits3V + 2U + 2AA. Steger
AbstractLas Vegas & Monte Carlo algorithms; inequalities of Markov, Chebyshev, Chernoff; negative correlation; Markov chains: convergence, rapidly mixing; generating functions; Examples include: min cut, median, balls and bins, routing in hypercubes, 3SAT, card shuffling, random walks
ObjectiveAfter this course students will know fundamental techniques from probabilistic combinatorics for designing randomized algorithms and will be able to apply them to solve typical problems in these areas.
ContentRandomized Algorithms are algorithms that "flip coins" to take certain decisions. This concept extends the classical model of deterministic algorithms and has become very popular and useful within the last twenty years. In many cases, randomized algorithms are faster, simpler or just more elegant than deterministic ones. In the course, we will discuss basic principles and techniques and derive from them a number of randomized methods for problems in different areas.
Lecture notesYes.
Literature- Randomized Algorithms, Rajeev Motwani and Prabhakar Raghavan, Cambridge University Press (1995)
- Probability and Computing, Michael Mitzenmacher and Eli Upfal, Cambridge University Press (2005)
252-0206-00LVisual Computing Information W8 credits4V + 3UM. Pollefeys, S. Coros
AbstractThis course acquaints students with core knowledge in computer graphics, image processing, multimedia and computer vision. Topics include: Graphics pipeline, perception and camera models, transformation, shading, global illumination, texturing, sampling, filtering, image representations, image and video compression, edge detection and optical flow.
ObjectiveThis course provides an in-depth introduction to the core concepts of computer graphics, image processing, multimedia and computer vision. The course forms a basis for the specialization track Visual Computing of the CS master program at ETH.
ContentCourse topics will include: Graphics pipeline, perception and color models, camera models, transformations and projection, projections, lighting, shading, global illumination, texturing, sampling theorem, Fourier transforms, image representations, convolution, linear filtering, diffusion, nonlinear filtering, edge detection, optical flow, image and video compression.

In theoretical and practical homework assignments students will learn to apply and implement the presented concepts and algorithms.
Lecture notesA scriptum will be handed out for a part of the course. Copies of the slides will be available for download. We will also provide a detailed list of references and textbooks.
LiteratureMarkus Gross: Computer Graphics, scriptum, 1994-2005
252-0543-01LComputer Graphics Information W7 credits3V + 2U + 1AM. Gross, M. Papas
AbstractThis course covers some of the fundamental concepts of computer graphics generation of photorealistic images from digital representations of 3D scenes and image-based methods for recovering digital scene representations from captured images.
ObjectiveAt the end of the course the students will be able to build a rendering system. The students will study the basic principles of rendering and image synthesis. In addition, the course is intended to stimulate the students' curiosity to explore the field of computer graphics in subsequent courses or on their own.
ContentThis course covers fundamental concepts of modern computer graphics. Students will learn about 3D object representations and the details of how to generate photorealistic images from digital representations of 3D scenes. Starting with an introduction to 3D shape modeling, geometry representation and texture mapping, we will move on to the physics of light transport, acceleration structures, appearance modeling and Monte Carlo integration. We will apply these principles for computing light transport of direct and global illumination due to surfaces and participating media. We will end with an overview of modern image-based capture and image synthesis methods, covering topics such as geometry and material capture, light-fields and depth-image based rendering.
Lecture notesno
LiteratureBooks:
High Dynamic Range Imaging: Acquisition, Display, and Image-Based Lighting
Multiple view geometry in computer vision
Physically Based Rendering: From Theory to Implementation
Prerequisites / NoticePrerequisites:
Fundamentals of calculus and linear algebra, basic concepts of algorithms and data structures, programming skills in C++, Visual Computing course recommended.
The programming assignments will be in C++. This will not be taught in the class.
252-0546-00LPhysically-Based Simulation in Computer Graphics Information W5 credits2V + 1U + 1AV. da Costa de Azevedo, B. Solenthaler
AbstractThis lecture provides an introduction to physically-based animation in computer graphics and gives an overview of fundamental methods and algorithms. The practical exercises include three assignments which are to be solved in small groups. In an addtional course project, topics from the lecture will be implemented into a 3D game or a comparable application.
ObjectiveThis lecture provides an introduction to physically-based animation in computer graphics and gives an overview of fundamental methods and algorithms. The practical exercises include three assignments which are to be solved in small groups. In an addtional course project, topics from the lecture will be implemented into a 3D game or a comparable application.
ContentThe lecture covers topics in physically-based modeling,
such as particle systems, mass-spring models, finite difference and finite element methods. These approaches are used to represent and simulate deformable objects or fluids with applications in animated movies, 3D games and medical systems. Furthermore, the lecture covers topics such as rigid body dynamics, collision detection, and character animation.
Prerequisites / NoticeFundamentals of calculus and physics, basic concepts of algorithms and data structures, basic programming skills in C++. Knowledge on numerical mathematics as well as ordinary and partial differential equations is an asset, but not required.
401-3627-00LHigh-Dimensional StatisticsW4 credits2VP. L. Bühlmann
Abstract"High-Dimensional Statistics" deals with modern methods and theory for statistical inference when the number of unknown parameters is of much larger order than sample size. Statistical estimation and algorithms for complex models and aspects of multiple testing will be discussed.
ObjectiveKnowledge of methods and basic theory for high-dimensional statistical inference
ContentLasso and Group Lasso for high-dimensional linear and generalized linear models; Additive models and many smooth univariate functions; Non-convex loss functions and l1-regularization; Stability selection, multiple testing and construction of p-values; Undirected graphical modeling
LiteraturePeter Bühlmann and Sara van de Geer (2011). Statistics for High-Dimensional Data: Methods, Theory and Applications. Springer Verlag.
ISBN 978-3-642-20191-2.
Prerequisites / NoticeKnowledge of basic concepts in probability theory, and intermediate knowledge of statistics (e.g. a course in linear models or computational statistics).
401-4623-00LTime Series Analysis
Does not take place this semester.
W6 credits3GN. Meinshausen
AbstractStatistical analysis and modeling of observations in temporal order, which exhibit dependence. Stationarity, trend estimation, seasonal decomposition, autocorrelations,
spectral and wavelet analysis, ARIMA-, GARCH- and state space models. Implementations in the software R.
ObjectiveUnderstanding of the basic models and techniques used in time series analysis and their implementation in the statistical software R.
ContentThis course deals with modeling and analysis of variables which change randomly in time. Their essential feature is the dependence between successive observations.
Applications occur in geophysics, engineering, economics and finance. Topics covered: Stationarity, trend estimation, seasonal decomposition, autocorrelations,
spectral and wavelet analysis, ARIMA-, GARCH- and state space models. The models and techniques are illustrated using the statistical software R.
Lecture notesNot available
LiteratureA list of references will be distributed during the course.
Prerequisites / NoticeBasic knowledge in probability and statistics
401-3901-00LMathematical Optimization Information W11 credits4V + 2UR. Zenklusen
AbstractMathematical treatment of diverse optimization techniques.
ObjectiveThe goal of this course is to get a thorough understanding of various classical mathematical optimization techniques with an emphasis on polyhedral approaches. In particular, we want students to develop a good understanding of some important problem classes in the field, of structural mathematical results linked to these problems, and of solution approaches based on this structural understanding.
ContentKey topics include:
- Linear programming and polyhedra;
- Flows and cuts;
- Combinatorial optimization problems and techniques;
- Equivalence between optimization and separation;
- Brief introduction to Integer Programming.
Literature- Bernhard Korte, Jens Vygen: Combinatorial Optimization. 6th edition, Springer, 2018.
- Alexander Schrijver: Combinatorial Optimization: Polyhedra and Efficiency. Springer, 2003. This work has 3 volumes.
- Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
- Alexander Schrijver: Theory of Linear and Integer Programming. John Wiley, 1986.
Prerequisites / NoticeSolid background in linear algebra.
402-2203-01LClassical Mechanics Information W7 credits4V + 2UM. Gaberdiel
AbstractA conceptual introduction to theoretical physics: Newtonian mechanics, central force problem, oscillations, Lagrangian mechanics, symmetries and conservation laws, spinning top, relativistic space-time structure, particles in an electromagnetic field, Hamiltonian mechanics, canonical transformations, integrable systems, Hamilton-Jacobi equation.
ObjectiveFundamental understanding of the description of Mechanics in the Lagrangian and Hamiltonian formulation. Detailed understanding of important applications, in particular, the Kepler problem, the physics of rigid bodies (spinning top) and of oscillatory systems.
227-1037-00LIntroduction to Neuroinformatics Information W6 credits2V + 1UV. Mante, M. Cook, B. Grewe, G. Indiveri, D. Kiper, W. von der Behrens
AbstractThe course provides an introduction to the functional properties of neurons. Particularly the description of membrane electrical properties (action potentials, channels), neuronal anatomy, synaptic structures, and neuronal networks. Simple models of computation, learning, and behavior will be explained. Some artificial systems (robot, chip) are presented.
ObjectiveUnderstanding computation by neurons and neuronal circuits is one of the great challenges of science. Many different disciplines can contribute their tools and concepts to solving mysteries of neural computation. The goal of this introductory course is to introduce the monocultures of physics, maths, computer science, engineering, biology, psychology, and even philosophy and history, to discover the enchantments and challenges that we all face in taking on this major 21st century problem and how each discipline can contribute to discovering solutions.
ContentThis course considers the structure and function of biological neural networks at different levels. The function of neural networks lies fundamentally in their wiring and in the electro-chemical properties of nerve cell membranes. Thus, the biological structure of the nerve cell needs to be understood if biologically-realistic models are to be constructed. These simpler models are used to estimate the electrical current flow through dendritic cables and explore how a more complex geometry of neurons influences this current flow. The active properties of nerves are studied to understand both sensory transduction and the generation and transmission of nerve impulses along axons. The concept of local neuronal circuits arises in the context of the rules governing the formation of nerve connections and topographic projections within the nervous system. Communication between neurons in the network can be thought of as information flow across synapses, which can be modified by experience. We need an understanding of the action of inhibitory and excitatory neurotransmitters and neuromodulators, so that the dynamics and logic of synapses can be interpreted. Finally, the neural architectures of feedforward and recurrent networks will be discussed in the context of co-ordination, control, and integration of sensory and motor information in neural networks.
227-1033-00LNeuromorphic Engineering I Information Restricted registration - show details
Registration in this class requires the permission of the instructors. Class size will be limited to available lab spots.
Preference is given to students that require this class as part of their major.
W6 credits2V + 3UT. Delbrück, G. Indiveri, S.‑C. Liu
AbstractThis course covers analog circuits with emphasis on neuromorphic engineering: MOS transistors in CMOS technology, static circuits, dynamic circuits, systems (silicon neuron, silicon retina, silicon cochlea) with an introduction to multi-chip systems. The lectures are accompanied by weekly laboratory sessions.
ObjectiveUnderstanding of the characteristics of neuromorphic circuit elements.
ContentNeuromorphic circuits are inspired by the organizing principles of biological neural circuits. Their computational primitives are based on physics of semiconductor devices. Neuromorphic architectures often rely on collective computation in parallel networks. Adaptation, learning and memory are implemented locally within the individual computational elements. Transistors are often operated in weak inversion (below threshold), where they exhibit exponential I-V characteristics and low currents. These properties lead to the feasibility of high-density, low-power implementations of functions that are computationally intensive in other paradigms. Application domains of neuromorphic circuits include silicon retinas and cochleas for machine vision and audition, real-time emulations of networks of biological neurons, and the development of autonomous robotic systems. This course covers devices in CMOS technology (MOS transistor below and above threshold, floating-gate MOS transistor, phototransducers), static circuits (differential pair, current mirror, transconductance amplifiers, etc.), dynamic circuits (linear and nonlinear filters, adaptive circuits), systems (silicon neuron, silicon retina and cochlea) and an introduction to multi-chip systems that communicate events analogous to spikes. The lectures are accompanied by weekly laboratory sessions on the characterization of neuromorphic circuits, from elementary devices to systems.
LiteratureS.-C. Liu et al.: Analog VLSI Circuits and Principles; various publications.
Prerequisites / NoticeParticular: The course is highly recommended for those who intend to take the spring semester course 'Neuromorphic Engineering II', that teaches the conception, simulation, and physical layout of such circuits with chip design tools.

Prerequisites: Background in basics of semiconductor physics helpful, but not required.
327-1201-00LTransport Phenomena I Information W5 credits4GJ. Vermant
AbstractPhenomenological approach to "Transport Phenomena" based on balance equations supplemented by thermodynamic considerations to formulate the undetermined fluxes in the local species mass, momentum, and energy balance equations; Solutions of a few selected problems will be discussed, introducing scaling approximations, similarity solutions and using numerical methods.
ObjectiveThe teaching goals of this course are on five different levels:
(1) Deep understanding of fundamentals: local balance equations, constitutive equations for fluxes, entropy balance, interfaces, idea of dimensionless numbers and scaling, ...
(2) Ability to use the fundamental concepts in applications
(3) Insight into the role of boundary conditions
(4) Knowledge of a number of applications.
(5) Flavor of numerical techniques: finite elements and finite differences.
ContentApproach to Transport Phenomena
Diffusion Equation
Brownian Dynamics
Refreshing Topics in Equilibrium Thermodynamics
Balance Equations
Forces and Fluxes
Measuring Transport Coefficients
Pressure-Driven Flows
Stokes flow and colloid microhydrodynamics.
Lecture notesThe course is based on the book D. C. Venerus and H. C. Öttinger, A Modern Course in Transport Phenomena (Cambridge University Press, 2018)
Literature1. D. C. Venerus and H. C. Öttinger, A Modern Course in Transport Phenomena (Cambridge University Press, 2018)
2. R. B. Bird, W. E. Stewart, and E. N. Lightfoot, Transport Phenomena, 2nd Ed. (Wiley, 2001)
3. L.G. Leal, Advanced Transport Phenomena (Oxford University Press, 2011)
4. W. M. Deen, Analysis of Transport Phenomena (Oxford University Press, 1998)
5. R. B. Bird, Five Decades of Transport Phenomena (Review Article), AIChE J. 50 (2004) 273-287
Prerequisites / NoticeComplex numbers. Vector analysis (integrability; Gauss' divergence theorem). Laplace and Fourier transforms. Ordinary differential equations (basic ideas). Linear algebra (matrices; functions of matrices; eigenvectors and eigenvalues; eigenfunctions). Probability theory (Gaussian distributions; Poisson distributions; averages; moments; variances; random variables). Numerical mathematics (integration). Equilibrium thermodynamics (Gibbs' fundamental equation; thermodynamic potentials; Legendre transforms). Maxwell equations. Programming and simulation techniques (Matlab, Monte Carlo simulations).
651-4273-00LNumerical Modelling in Fortran Information W3 credits2VP. Tackley
AbstractThis course gives an introduction to programming in FORTRAN95, and is suitable for students who have only minimal programming experience. The focus will be on Fortran 95, but Fortran 77 will also be covered for those working with already-existing codes. A hands-on approach will be emphasized rather than abstract concepts.
ObjectiveFORTRAN 95 is a modern programming language that is specifically designed for scientific and engineering applications. This course gives an introduction to programming in this language, and is suitable for students who have only minimal programming experience, for example with MATLAB scripts. The focus will be on Fortran 95, but Fortran 77 will also be covered for those working with already-existing codes. A hands-on approach will be emphasized rather than abstract concepts, using example scientific problems relevant to Earth science.
Lecture notesSee Link
» see also Fields of Specialization
» Electives (CSE Master)
Additional Electives from the Fields of Specialization (CSE Master)
NumberTitleTypeECTSHoursLecturers
651-4053-05LBoundary Layer MeteorologyW4 credits3GM. Rotach, P. Calanca
AbstractThe Planetary Boundary Layer (PBL) constitutes the interface between the atmosphere and the Earth's surface. Theory on transport processes in the PBL and their dynamics is provided. This course treats theoretical background and idealized concepts. These are contrasted to real world applications and current research issues.
ObjectiveOverall goals of this course are given below. Focus is on the theoretical background and idealised concepts.
Students have basic knowledge on atmospheric turbulence and theoretical as well as practical approaches to treat Planetary Boundary Layer flows. They are familiar with the relevant processes (turbulent transport, forcing) within, and typical states of the Planetary Boundary Layer. Idealized concepts are known as well as their adaptations under real surface conditions (as for example over complex topography).
Content- Introduction
- Turbulence
- Statistical tratment of turbulence, turbulent transport
- Conservation equations in a turbulent flow
- Closure problem and closure assumptions
- Scaling and similarity theory
- Spectral characteristics
- Concepts for non-ideal boundary layer conditions
Lecture notesavailable (i.e. in English)
Literature- Stull, R.B.: 1988, "An Introduction to Boundary Layer Meteorology", (Kluwer), 666 pp.
- Panofsky, H. A. and Dutton, J.A.: 1984, "Atmospheric Turbulence, Models and Methods for Engineering Applications", (J. Wiley), 397 pp.
- Kaimal JC and Finningan JJ: 1994, Atmospheric Boundary Layer Flows, Oxford University Press, 289 pp.
- Wyngaard JC: 2010, Turbulence in the Atmosphere, Cambridge University Press, 393pp.
Prerequisites / NoticeUmwelt-Fluiddynamik (701-0479-00L) (environment fluid dynamics) or equivalent and basic knowledge in atmospheric science
701-1221-00LDynamics of Large-Scale Atmospheric Flow Information W4 credits2V + 1UH. Wernli, L. Papritz
AbstractThis lecture course is about the fundamental aspects of the dynamics of extratropical weather systems (quasi-geostropic dynamics, potential vorticity, Rossby waves, baroclinic instability). The fundamental concepts are formally introduced, quantitatively applied and illustrated with examples from the real atmosphere. Exercises (quantitative and qualitative) form an essential part of the course.
ObjectiveUnderstanding the dynamics of large-scale atmospheric flow
ContentDynamical Meteorology is concerned with the dynamical processes of the
earth's atmosphere. The fundamental equations of motion in the atmosphere will be discussed along with the dynamics and interactions of synoptic system - i.e. the low and high pressure systems that determine our weather. The motion of such systems can be understood in terms of quasi-geostrophic theory. The lecture course provides a derivation of the mathematical basis along with some interpretations and applications of the concept.
Lecture notesDynamics of large-scale atmospheric flow
Literature- Holton J.R., An introduction to Dynamic Meteorogy. Academic Press, fourth edition 2004,
- Pichler H., Dynamik der Atmosphäre, Bibliographisches Institut, 456 pp. 1997
Prerequisites / NoticePhysics I, II, Environmental Fluid Dynamics
529-0003-01LAdvanced Quantum Chemistry
IMPORTANT NOTICE for Chemistry students: There are two different version of this course for the two regulations (2005/2018), please make sure to register for the correct version according to the regulations you are enrolled in. Please do not register for this course if you are enrolled in Chemistry regulations 2005.
W6 credits3GM. Reiher, S. Knecht
AbstractAdvanced, but fundamental topics central to the understanding of theory in chemistry and for solving actual chemical problems with a computer.
Examples are:
* Operators derived from principles of relativistic quantum mechanics
* Relativistic effects + methods of relativistic quantum chemistry
* Open-shell molecules + spin-density functional theory
* New electron-correlation theories
ObjectiveThe aim of the course is to provide an in-depth knowledge of theory and method development in theoretical chemistry. It will be shown that this is necessary in order to be able to solve actual chemical problems on a computer with quantum chemical methods.

The relativistic re-derivation of all concepts known from (nonrelativistic) quantum mechanics and quantum-chemistry lectures will finally explain the form of all operators in the molecular Hamiltonian - usually postulated rather than deduced. From this, we derive operators needed for molecular spectroscopy (like those required by magnetic resonance spectroscopy). Implications of other assumptions in standard non-relativistic quantum chemistry shall be analyzed and understood, too. Examples are the Born-Oppenheimer approximation and the expansion of the electronic wave function in a set of pre-defined many-electron basis functions (Slater determinants). Overcoming these concepts, which are so natural to the theory of chemistry, will provide deeper insights into many-particle quantum mechanics. Also revisiting the workhorse of quantum chemistry, namely density functional theory, with an emphasis on open-shell electronic structures (radicals, transition-metal complexes) will contribute to this endeavor. It will be shown how these insights allow us to make more accurate predictions in chemistry in practice - at the frontier of research in theoretical chemistry.
Content1) Introductory lecture: basics of quantum mechanics and quantum chemistry
2) Einstein's special theory of relativity and the (classical) electromagnetic interaction of two charged particles
3) Klein-Gordon and Dirac equation; the Dirac hydrogen atom
4) Numerical methods based on the Dirac-Fock-Coulomb Hamiltonian, two-component and scalar relativistic Hamiltonians
5) Response theory and molecular properties, derivation of property operators, Breit-Pauli-Hamiltonian
6) Relativistic effects in chemistry and the emergence of spin
7) Spin in density functional theory
8) New electron-correlation theories: Tensor network and matrix product states, the density matrix renormalization group
9) Quantum chemistry without the Born-Oppenheimer approximation
Lecture notesA set of detailed lecture notes will be provided, which will cover the whole course.
Literature1) M. Reiher, A. Wolf, Relativistic Quantum Chemistry, Wiley-VCH, 2014, 2nd edition
2) F. Schwabl: Quantenmechanik für Fortgeschrittene (QM II), Springer-Verlag, 1997
[english version available: F. Schwabl, Advanced Quantum Mechanics]
3) R. McWeeny: Methods of Molecular Quantum Mechanics, Academic Press, 1992
4) C. R. Jacob, M. Reiher, Spin in Density-Functional Theory, Int. J. Quantum Chem. 112 (2012) 3661
Link
5) K. H. Marti, M. Reiher, New Electron Correlation Theories for Transition Metal Chemistry, Phys. Chem. Chem. Phys. 13 (2011) 6750
Link
6) K.H. Marti, M. Reiher, The Density Matrix Renormalization Group Algorithm in Quantum Chemistry, Z. Phys. Chem. 224 (2010) 583
Link
7) E. Mátyus, J. Hutter, U. Müller-Herold, M. Reiher, On the emergence of molecular structure, Phys. Rev. A 83 2011, 052512
Link

Note also the standard textbooks:
A) A. Szabo, N.S. Ostlund. Verlag, Dover Publications
B) I. N. Levine, Quantum Chemistry, Pearson
C) T. Helgaker, P. Jorgensen, J. Olsen: Molecular Electronic-Structure Theory, Wiley, 2000
D) R.G. Parr, W. Yang: Density-Functional Theory of Atoms and Molecules, Oxford University Press, 1994
E) R.M. Dreizler, E.K.U. Gross: Density Functional Theory, Springer-Verlag, 1990
Prerequisites / NoticeStrongly recommended (preparatory) courses are: quantum mechanics and quantum chemistry
151-0105-00LQuantitative Flow VisualizationW4 credits3GT. Rösgen
AbstractThe course provides an introduction to digital image analysis in modern flow diagnostics. Different techniques which are discussed include image velocimetry, laser induced fluorescence, liquid crystal thermography and interferometry. The physical foundations and measurement configurations are explained. Image analysis algorithms are presented in detail and programmed during the exercises.
ObjectiveIntroduction to modern imaging techniques and post processing algorithms with special emphasis on flow analysis and visualization.
Understanding of hardware and software requirements and solutions.
Development of basic programming skills for (generic) imaging applications.
ContentFundamentals of optics, flow visualization and electronic image acquisition.
Frequently used mage processing techniques (filtering, correlation processing, FFTs, color space transforms).
Image Velocimetry (tracking, pattern matching, Doppler imaging).
Surface pressure and temperature measurements (fluorescent paints, liquid crystal imaging, infrared thermography).
Laser induced fluorescence.
(Digital) Schlieren techniques, phase contrast imaging, interferometry, phase unwrapping.
Wall shear and heat transfer measurements.
Pattern recognition and feature extraction, proper orthogonal decomposition.
Lecture notesHandouts will be made available.
Prerequisites / NoticePrerequisites: Fluiddynamics I, Numerical Mathematics, programming skills.
Language: German on request.
151-0109-00LTurbulent FlowsW4 credits2V + 1UP. Jenny
AbstractContents
- Laminar and turbulent flows, instability and origin of turbulence - Statistical description: averaging, turbulent energy, dissipation, closure problem - Scalings. Homogeneous isotropic turbulence, correlations, Fourier representation, energy spectrum - Free turbulence: wake, jet, mixing layer - Wall turbulence: Channel and boundary layer - Computation and modelling of turbulent flows
ObjectiveBasic physical phenomena of turbulent flows, quantitative and statistical description, basic and averaged equations, principles of turbulent flow computation and elements of turbulence modelling
Content- Properties of laminar, transitional and turbulent flows.
- Origin and control of turbulence. Instability and transition.
- Statistical description, averaging, equations for mean and fluctuating quantities, closure problem.
- Scalings, homogeneous isotropic turbulence, energy spectrum.
- Turbulent free shear flows. Jet, wake, mixing layer.
- Wall-bounded turbulent flows.
- Turbulent flow computation and modeling.
Lecture notesLecture notes are available
LiteratureS.B. Pope, Turbulent Flows, Cambridge University Press, 2000
151-0213-00LFluid Dynamics with the Lattice Boltzmann Method
Does not take place this semester.
W4 credits3GI. Karlin
AbstractThe course provides an introduction to theoretical foundations and practical usage of the Lattice Boltzmann Method for fluid dynamics simulations.
ObjectiveMethods like molecular dynamics, DSMC, lattice Boltzmann etc are being increasingly used by engineers all over and these methods require knowledge of kinetic theory and statistical mechanics which are traditionally not taught at engineering departments. The goal of this course is to give an introduction to ideas of kinetic theory and non-equilibrium thermodynamics with a focus on developing simulation algorithms and their realizations.

During the course, students will be able to develop a lattice Boltzmann code on their own. Practical issues about implementation and performance on parallel machines will be demonstrated hands on.

Central element of the course is the completion of a lattice Boltzmann code (using the framework specifically designed for this course).

The course will also include a review of topics of current interest in various fields of fluid dynamics, such as multiphase flows, reactive flows, microflows among others.

Optionally, we offer an opportunity to complete a project of student's choice as an alternative to the oral exam. Samples of projects completed by previous students will be made available.
ContentThe course builds upon three parts:
I Elementary kinetic theory and lattice Boltzmann simulations introduced on simple examples.
II Theoretical basis of statistical mechanics and kinetic equations.
III Lattice Boltzmann method for real-world applications.

The content of the course includes:

1. Background: Elements of statistical mechanics and kinetic theory:
Particle's distribution function, Liouville equation, entropy, ensembles; Kinetic theory: Boltzmann equation for rarefied gas, H-theorem, hydrodynamic limit and derivation of Navier-Stokes equations, Chapman-Enskog method, Grad method, boundary conditions; mean-field interactions, Vlasov equation;
Kinetic models: BGK model, generalized BGK model for mixtures, chemical reactions and other fluids.

2. Basics of the Lattice Boltzmann Method and Simulations:
Minimal kinetic models: lattice Boltzmann method for single-component fluid, discretization of velocity space, time-space discretization, boundary conditions, forcing, thermal models, mixtures.

3. Hands on:
Development of the basic lattice Boltzmann code and its validation on standard benchmarks (Taylor-Green vortex, lid-driven cavity flow etc).

4. Practical issues of LBM for fluid dynamics simulations:
Lattice Boltzmann simulations of turbulent flows;
numerical stability and accuracy.

5. Microflow:
Rarefaction effects in moderately dilute gases; Boundary conditions, exact solutions to Couette and Poiseuille flows; micro-channel simulations.

6. Advanced lattice Boltzmann methods:
Entropic lattice Boltzmann scheme, subgrid simulations at high Reynolds numbers; Boundary conditions for complex geometries.

7. Introduction to LB models beyond hydrodynamics:
Relativistic fluid dynamics; flows with phase transitions.
Lecture notesLecture notes on the theoretical parts of the course will be made available.
Selected original and review papers are provided for some of the lectures on advanced topics.
Handouts and basic code framework for implementation of the lattice Boltzmann models will be provided.
Prerequisites / NoticeThe course addresses mainly graduate students (MSc/Ph D) but BSc students can also attend.
151-0207-00LTheory and Modeling of Reactive FlowsW4 credits3GC. E. Frouzakis, I. Mantzaras
AbstractThe course first reviews the governing equations and combustion chemistry, setting the ground for the analysis of homogeneous gas-phase mixtures, laminar diffusion and premixed flames. Catalytic combustion and its coupling with homogeneous combustion are dealt in detail, and turbulent combustion modeling approaches are presented. Available numerical codes will be used for modeling.
ObjectiveTheory of combustion with numerical applications
ContentThe analysis of realistic reactive flow systems necessitates the use of detailed computer models that can be constructed starting from first principles i.e. thermodynamics, fluid mechanics, chemical kinetics, and heat
and mass transport. In this course, the focus will be on combustion theory and modeling. The reacting flow governing equations and the combustion chemistry are firstly reviewed, setting the ground for the analysis of
homogeneous gas-phase mixtures, laminar diffusion and premixed flames. Heterogeneous (catalytic) combustion, an area of increased importance in the last years, will be dealt in detail along with its coupling with homogeneous
combustion. Finally, approaches for the modeling of turbulent combustion will be presented. Available numerical codes will be used to compute the above described phenomena. Familiarity with numerical methods for the solution of partial differential equations is expected.
Lecture notesHandouts
Prerequisites / NoticeNEW course
252-0535-00LAdvanced Machine Learning Information W8 credits3V + 2U + 2AJ. M. Buhmann
AbstractMachine learning algorithms provide analytical methods to search data sets for characteristic patterns. Typical tasks include the classification of data, function fitting and clustering, with applications in image and speech analysis, bioinformatics and exploratory data analysis. This course is accompanied by practical machine learning projects.
ObjectiveStudents will be familiarized with advanced concepts and algorithms for supervised and unsupervised learning; reinforce the statistics knowledge which is indispensible to solve modeling problems under uncertainty. Key concepts are the generalization ability of algorithms and systematic approaches to modeling and regularization. Machine learning projects will provide an opportunity to test the machine learning algorithms on real world data.
ContentThe theory of fundamental machine learning concepts is presented in the lecture, and illustrated with relevant applications. Students can deepen their understanding by solving both pen-and-paper and programming exercises, where they implement and apply famous algorithms to real-world data.

Topics covered in the lecture include:

Fundamentals:
What is data?
Bayesian Learning
Computational learning theory

Supervised learning:
Ensembles: Bagging and Boosting
Max Margin methods
Neural networks

Unsupservised learning:
Dimensionality reduction techniques
Clustering
Mixture Models
Non-parametric density estimation
Learning Dynamical Systems
Lecture notesNo lecture notes, but slides will be made available on the course webpage.
LiteratureC. Bishop. Pattern Recognition and Machine Learning. Springer 2007.

R. Duda, P. Hart, and D. Stork. Pattern Classification. John Wiley &
Sons, second edition, 2001.

T. Hastie, R. Tibshirani, and J. Friedman. The Elements of Statistical
Learning: Data Mining, Inference and Prediction. Springer, 2001.

L. Wasserman. All of Statistics: A Concise Course in Statistical
Inference. Springer, 2004.
Prerequisites / NoticeThe course requires solid basic knowledge in analysis, statistics and numerical methods for CSE as well as practical programming experience for solving assignments.
Students should have followed at least "Introduction to Machine Learning" or an equivalent course offered by another institution.

PhD students are required to obtain a passing grade in the course (4.0 or higher based on project and exam) to gain credit points.
636-0017-00LComputational Biology Information W6 credits3G + 2AT. Vaughan, T. Stadler
AbstractThe aim of the course is to provide up-to-date knowledge on how we can study biological processes using genetic sequencing data. Computational algorithms extracting biological information from genetic sequence data are discussed, and statistical tools to understand this information in detail are introduced.
ObjectiveAttendees will learn which information is contained in genetic sequencing data and how to extract information from this data using computational tools. The main concepts introduced are:
* stochastic models in molecular evolution
* phylogenetic & phylodynamic inference
* maximum likelihood and Bayesian statistics
Attendees will apply these concepts to a number of applications yielding biological insight into:
* epidemiology
* pathogen evolution
* macroevolution of species
ContentThe course consists of four parts. We first introduce modern genetic sequencing technology, and algorithms to obtain sequence alignments from the output of the sequencers. We then present methods for direct alignment analysis using approaches such as BLAST and GWAS. Second, we introduce mechanisms and concepts of molecular evolution, i.e. we discuss how genetic sequences change over time. Third, we employ evolutionary concepts to infer ancestral relationships between organisms based on their genetic sequences, i.e. we discuss methods to infer genealogies and phylogenies. Lastly, we introduce the field of phylodynamics, the aim of which is to understand and quantify population dynamic processes (such as transmission in epidemiology or speciation & extinction in macroevolution) based on a phylogeny. Throughout the class, the models and methods are illustrated on different datasets giving insight into the epidemiology and evolution of a range of infectious diseases (e.g. HIV, HCV, influenza, Ebola). Applications of the methods to the field of macroevolution provide insight into the evolution and ecology of different species clades. Students will be trained in the algorithms and their application both on paper and in silico as part of the exercises.
Lecture notesLecture slides will be available on moodle.
LiteratureThe course is not based on any of the textbooks below, but they are excellent choices as accompanying material:
* Yang, Z. 2006. Computational Molecular Evolution.
* Felsenstein, J. 2004. Inferring Phylogenies.
* Semple, C. & Steel, M. 2003. Phylogenetics.
* Drummond, A. & Bouckaert, R. 2015. Bayesian evolutionary analysis with BEAST.
Prerequisites / NoticeBasic knowledge in linear algebra, analysis, and statistics will be helpful. Programming in R will be required for the project work (compulsory continuous performance assessments). We provide an R tutorial and help sessions during the first two weeks of class to learn the required skills. However, in case you do not have any previous experience with R, we strongly recommend to get familiar with R prior to the semester start. For the D-BSSE students, we highly recommend the voluntary course „Introduction to Programming“, which takes place at D-BSSE from Wednesday, September 12 to Friday, September 14, i.e. BEFORE the official semester starting date Link
For the Zurich-based students without R experience, we recommend the R course Link, or working through the script provided as part of this R course.
Case Studies
NumberTitleTypeECTSHoursLecturers
401-3667-69LCase Studies Seminar (Autumn Semester 2019)W3 credits2SV. C. Gradinaru, R. Hiptmair, M. Reiher
AbstractIn the CSE Case Studies Seminar invited speakers from ETH, from other universities as well as from industry give a talk on an applied topic. Beside of attending the scientific talks students are asked to give short presentations (10 minutes) on a published paper out of a list.
Objective
Prerequisites / Notice75% attendance and a short presentation on a published paper out of a list or on some own project are mandatory. Students that realize that they will not fulfill this criteria have to contact the teaching staff or de-register before the end of semester from the Seminar if they want to avoid a "Fail" in their documents. Later de-registrations will not be considered.
GESS Science in Perspective
Science in Perspective
» see Science in Perspective: Type A: Enhancement of Reflection Capability
» Recommended Science in Perspective (Type B) for D-MATH.
Science in Perspective
» see Science in Perspective: Language Courses ETH/UZH
Colloquia
NumberTitleTypeECTSHoursLecturers
401-5650-00LZurich Colloquium in Applied and Computational Mathematics Information E-0 credits2KR. Abgrall, R. Alaifari, H. Ammari, R. Hiptmair, S. Mishra, S. Sauter, C. Schwab
AbstractResearch colloquium
Objective