Dagstuhl-Seminar 09391
Algorithms and Complexity for Continuous Problems
( 20. Sep – 25. Sep, 2009 )
(zum Vergrößern in der Bildmitte klicken)
Permalink
Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite:
https://www.dagstuhl.de/09391
Organisatoren
- Thomas Müller-Gronbach (Universität Passau, DE)
- Leszek Plaskota (University of Warsaw, PL)
- Joseph F. Traub (Columbia University - New York, US)
Kontakt
Programm
This was already the 10th Dagstuhl Seminar on Algorithms and Complexity for Continuous Problems over a period of 18 years. It brings together researchers from different communities working on computational aspects of continuous problems, including computer scientists, numerical analysts, applied and pure mathematicians, and statisticians. Although the Seminar title has remained the same many of the topics and participants change with each Seminar. Each seminar in this series is of a very interdisciplinary nature.
Continuous problems arise in diverse areas of science and engineering. Examples include multivariate and path integration, approximation, optimization, operator equations, (stochastic) ordinary as well as (stochastic) partial differential equations. Typically, only partial and/or noisy information is available, and the aim is to solve the problem with a given error tolerance using the minimal amount of computational resources. For example, in multivariate numerical integration one wants to compute an $\varepsilon$-approximation to the integral with the minimal number of function evaluations.
Still growing need of efficiently solving more and more complicated computational problems makes this branch of science both important and challenging. The current seminar attracted 58 participants from 11 different countries all over the world. About 30% of them were young researchers including PhD students. There were 53 presentations covering in particular the following topics:
- tractability of high dimensional problems
- computational stochastic processes
- numerical analysis of operator equations
- inverse and ill-posed problems
- applications in computer graphics and finance
The work of the attendants was supported by a variety of funding agencies. This includes the Deutsche Forschungsgemeinschaft, the National Science Foundation and the Defense Advanced Research Projects Agency (USA), and the Australian Research Council. Many of the attendants from Germany were supported within the DFG priority program SPP 1324 on "Extraction of Quantifiable Information from Complex Systems", which is strongly connected to the topics of the seminar.
As always, the excellent working conditions and friendly atmosphere provided by the Dagstuhl team have led to a rich exchange of ideas as well as a number of new collaborations.
Selected papers related to this seminar will be published in a special issue of the Journal of Complexity.
- Jan Baldeaux (UNSW - Sydney, AU)
- James M. Calvin (NJIT - Newark, US) [dblp]
- Hui Cao (RICAM - Linz, AT)
- Ronald Cools (KU Leuven, BE) [dblp]
- Stephan Dahlke (Universität Marburg, DE) [dblp]
- Thomas Daun (TU Kaiserslautern, DE)
- Steffen Dereich (TU Berlin, DE) [dblp]
- Josef Dick (UNSW - Sydney, AU) [dblp]
- Jochen Garcke (TU Berlin, DE)
- Stefan Geiss (University of Jyväskylä, FI) [dblp]
- Michael Gnewuch (Christian-Albrechts-Universität zu Kiel, DE) [dblp]
- Maciej Gocwin (AGH Univ. of Science & Technology-Krakow, PL)
- Michael Griebel (Universität Bonn, DE) [dblp]
- Markus Hansen (Universität Jena, DE)
- Markus Hegland (Australian National University - Canberra, AU) [dblp]
- Felix Heidenreich (TU Darmstadt, DE)
- Stefan Heinrich (TU Kaiserslautern, DE) [dblp]
- Daniel Henkel (TU Darmstadt, DE)
- Kerstin Hesse (University of Sussex - Brighton, GB)
- Fred J. Hickernell (Illinois Institute of Technology - Chicago, US) [dblp]
- Aicke Hinrichs (Universität Jena, DE) [dblp]
- Alexander Keller (mental images - Berlin, DE) [dblp]
- Thomas Kühn (Universität Leipzig, DE) [dblp]
- Mikhail A. Lifshits (St. Petersburg University, RU)
- Yongping Liu (Beijing Normal University, CN)
- Shuai Lu (RICAM - Linz, AT)
- Peter Mathé (Weierstraß Institut - Berlin, DE) [dblp]
- Klaus Meer (BTU Cottbus, DE) [dblp]
- Hrushikesh N. Mhaskar (California State Univ. - Los Angeles, US)
- Bernhard Milla (TU Kaiserslautern, DE)
- Thomas Müller-Gronbach (Universität Passau, DE) [dblp]
- Andreas Neuenkirch (TU Dortmund, DE) [dblp]
- Erich Novak (Universität Jena, DE) [dblp]
- Dirk Nuyens (KU Leuven, BE) [dblp]
- Anargyros Papageorgiou (Columbia University - New York, US) [dblp]
- Sergei Pereverzyev (RICAM - Linz, AT) [dblp]
- Iasonas Petras (Columbia University, US)
- Friedrich Pillichshammer (Universität Linz, AT) [dblp]
- Leszek Plaskota (University of Warsaw, PL) [dblp]
- Pawel Przybylowicz (AGH Univ. of Science & Technology-Krakow, PL) [dblp]
- Thorsten Raasch (Universität Marburg, DE)
- Klaus Ritter (TU Darmstadt, DE) [dblp]
- Daniel Rudolf (Universität Jena, DE) [dblp]
- Wolfgang Ch. Schmid (Universität Salzburg, AT)
- Reinhold Schneider (TU Berlin, DE)
- Winfried Sickel (Universität Jena, DE) [dblp]
- Krzysztof Sikorski (University of Utah - Salt Lake City, US)
- Ian H. Sloan (UNSW - Sydney, AU) [dblp]
- Marek Szczesny (AGH Univ. of Science & Technology-Krakow, PL)
- Gerd Teschke (Hochschule Neubrandenburg, DE)
- Shu Tezuka (Kyushu University - Fukuoka, JP)
- Joseph F. Traub (Columbia University - New York, US) [dblp]
- Jan Vybíral (Universität Jena, DE) [dblp]
- Przemyslaw Wojtaszczyk (University of Warsaw, PL)
- Henryk Wozniakowski (Columbia University - New York, US) [dblp]
- Tiange Xu (TU Darmstadt, DE)
- Larisa Yaroslavtseva (Universität Passau, DE) [dblp]
- Chi Zhang (Columbia University - New York, US)
Verwandte Seminare
- Dagstuhl-Seminar 9116: Algorithms and Complexity of Continuous Problems (1991-04-15 - 1991-04-19) (Details)
- Dagstuhl-Seminar 9242: Algorithms and Complexity for Continuous Problems (1992-10-12 - 1992-10-16) (Details)
- Dagstuhl-Seminar 9442: Algorithms and Complexity for Continuous Problems (1994-10-17 - 1994-10-21) (Details)
- Dagstuhl-Seminar 9643: Algorithms and Complexity for Continuous Problems (1996-10-21 - 1996-10-25) (Details)
- Dagstuhl-Seminar 98201: Algorithms and Complexity for Continuous Problems (1998-05-18 - 1998-05-22) (Details)
- Dagstuhl-Seminar 00391: Algorithms and Complexity for Continuous Problems (2000-09-24 - 2000-09-29) (Details)
- Dagstuhl-Seminar 02401: Algorithms and Complexity for Continuous Problems (2002-09-29 - 2002-10-04) (Details)
- Dagstuhl-Seminar 04401: Algorithms and Complexity for Continuous Problems (2004-09-26 - 2004-10-01) (Details)
- Dagstuhl-Seminar 06391: Algorithms and Complexity for Continuous Problems (2006-09-24 - 2006-09-29) (Details)
- Dagstuhl-Seminar 12391: Algorithms and Complexity for Continuous Problems (2012-09-23 - 2012-09-28) (Details)
- Dagstuhl-Seminar 15391: Algorithms and Complexity for Continuous Problems (2015-09-20 - 2015-09-25) (Details)
- Dagstuhl-Seminar 19341: Algorithms and Complexity for Continuous Problems (2019-08-18 - 2019-08-23) (Details)
- Dagstuhl-Seminar 23351: Algorithms and Complexity for Continuous Problems (2023-08-27 - 2023-09-01) (Details)
Klassifikation
- data structures / algorithms / complexity
Schlagworte
- Quantum computation
- Tractability
- High-dimensional problems
- Operator equations
- Computational learning theory
- Computational stochastic processes
