Michael Obersteiner, M.Sc.: Difference between revisions

From Sccswiki
Jump to navigation Jump to search
Line 28: Line 28:
=== Open Hiwi Positions ===
=== Open Hiwi Positions ===


*Developing a testing-framework for the distributed combination technique:
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.  
*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
Workload: around 8h/week



Revision as of 15:51, 17 January 2018

Michael Obersteiner
Michael Obersteiner

Address:

TU München
Institut für Informatik
Boltzmannstr. 3
85748 Garching b. München
Office:
MI 02.05.060
Email:
Obersteinermail.png
Phone:
(089) 289 18 600
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. Molzer: Implementation of a Parallel Sparse Grid Combination Technique for Variable Process Group Sizes
    Bachelor's thesis, Fakultät für Informatik, MSE, since July 2017
  • D. Damerow: Coupling general purpose PDE solvers with a Combination Technique Framework
    Bachelor's thesis, Fakultät für Informatik, Informatics, since December 2017
  • S. Shenoy: Towards Non-blocking Combination Schemes in the Sparse Grid Combination Technique
    Master's thesis, Fakultät für Informatik, CSE, since December 2017

Finished Student Projects

<pubsccs>noheader=1&nocaption=1&lang=en&betreuerid=114</pubsccs>

Teaching

Tutor for many years in Numerical Programming

Publications

<pubsccs>noheader=1&lang=en&persid=114&nocaption=1&utypid=1010,1020,1030,2010,2020,2030,2040,2050,2060,2070</pubsccs>

Talks

<pubsccs>noheader=1&nocaption=1&lang=en&persid=114&utypid=1120,2090,3070</pubsccs>