AdaptLocalMOR2013: Difference between revisions
No edit summary |
|||
| Line 8: | Line 8: | ||
'''19. September 2013'''<br /> | '''19. September 2013'''<br /> | ||
'''10:00 AM - 4:00 PM'''<br /> | '''10:00 AM - 4:00 PM'''<br /> | ||
'''Room: tba | '''Room: tba'''<br /> | ||
Department of Informatics<br /> | |||
Boltzmannstr. 3<br /> | |||
85748 Garching<br /> | |||
Germany<br /> | |||
Organizers: Hans-Joachim Bungartz (TUM), Karen Willcox (MIT), and Benjamin Peherstorfer (TUM) | Organizers: Hans-Joachim Bungartz (TUM), Karen Willcox (MIT), and Benjamin Peherstorfer (TUM) | ||
| Line 38: | Line 42: | ||
tba | tba | ||
= How to get there = | |||
The website of the computer science department contains travelling informations [http://www.in.tum.de/en/metanavigation/people-and-services/travelling-time.html here] | |||
= Contact = | = Contact = | ||
Revision as of 17:32, 27 July 2013
Workshop on Adaptive and Local Model Order Reduction with Machine Learning for Parametrized Systems
19. September 2013
10:00 AM - 4:00 PM
Room: tba
Department of Informatics
Boltzmannstr. 3
85748 Garching
Germany
Organizers: Hans-Joachim Bungartz (TUM), Karen Willcox (MIT), and Benjamin Peherstorfer (TUM)
Description
Most of today's simulations in computational science and engineering are solved many times in a row for different parameter configurations, e.g., in optimization, uncertainty quantification, and statistical inverse problems. To cope with the consequentially increased computational costs, model order reduction methods approximate the large-scale simulations with low-cost surrogates by solving the problem not in a general, high-dimensional solution space but in a problem-dependent, low-dimensional subspace. Classical approaches construct one subspace and use it for all parameter configurations and time steps. In contrast, adaptive and local model reduction methods construct multiple low-dimensional subspaces, each of them tailored to a particular region of characteristic system behavior. Machine learning techniques are a versatile way to detect these characteristic system behaviors from data and to derive reduced-order models with the obtained information.
This workshop brings together scientists to discuss recent advances in adaptive and local model order reduction. It also wraps up an MIT-TUM research collaboration funded by the MIT Germany Seed Fund (MISTI) where adaptive and local methods have been investigated. The workshop is organized together with the TUM Institute for Advanced Study and the focus group on high-performance computing (HPC).
Participation
Please register in advance here.
Program
Confirmed speakers are
- Felix Albrecht (U Münster)
- Lihong Feng (MPI Magdeburg)
- Bernard Haasdonk (U Stuttgart)
- Markus Hegland (ANU)
- Qifeng Liao (MIT)
- Benjamin Stamm (UPMC)
- Bernhard Wieland (U Ulm)
A schedule will follow shortly.
Abstracts
tba
How to get there
The website of the computer science department contains travelling informations here
Contact
Contact person is Benjamin Peherstorfer
Acknowledgement
The workshop is supported by the MIT-Germany Seed Fund and by the TUM-IAS focus group on high-performance computing.