Difference between revisions of "Michael Obersteiner, M.Sc."

From Sccswiki
Jump to navigation Jump to search
 
(No difference)

Latest revision as of 17:29, 30 June 2020

Michael Obersteiner

Address:

TU München
Institut für Informatik
Boltzmannstr. 3
85748 Garching b. München
Office:
MI 02.05.053
Email:
Obersteinermail.png
Phone:
(089) 289 18 634
Fax:
(089) 289 18 607
Office Hours:
by arrangement


Research interests

  • Molecular Dynamics
  • HPC
  • Combination technique
  • Sparse Grids Methods
  • Machine Learning

Student Projects

Open Hiwi Positions

Developing a testing-framework for the distributed combination technique:

  • In this Hiwi position students create and manage an automatic test environment using Jenkins within Gitlab. In addition the existing code will be extended by several unit tests to facilitate the code development. Good C++ knowledge is advised and testing experience would be helpful.

Workload: around 8h/week

Open Student Projects

see: https://www5.in.tum.de/wiki/index.php/Projects_in_Sparse_Grids_and_High_Dimensional_Approximation

You can also come to my office and discuss possible topics.

Running Student Projects

  • M. Fabry: Evaluating the Spatially Adaptive Combination Technique for Density Estimation, Master's Thesis, Fakultät für Informatik, Informatics, since February 2020
  • P. Resch: Adaptive Romberg-Quadrature for the Sparse Grid Combination Technique, Bachelor's Thesis, Fakultät für Informatik, Informatics/Edu, since May 2020
  • C. Moser: Machine Learning with the Sparse Grid Density Estimation using the Combination Technique, Bachelor's Thesis, Fakultät für Informatik, Informatics, since May 2020

Finished Student Projects

  • F. Schwaiger: Simulation eines Dammbruchszenarios
    MSE research project, MSE, November 2017

Teaching

  • Übungsleitung Algorithms for Scientific Computing SS18, SS19
  • Übungsleitung Numerisches Programmieren SoSe 2017, WiSe 2017/18, WiSe 2018/2019, WiSe 2019/2020
  • Tutor Diskrete Strukturen, WiSe 2016/2017

Tutor for many years in Numerical Programming

Publications

Talks