Dagstuhl Seminar 04401
Algorithms and Complexity for Continuous Problems
( Sep 26 – Oct 01, 2004 )
(Click in the middle of the image to enlarge)
Permalink
Please use the following short url to reference this page:
https://www.dagstuhl.de/04401
Organizers
- Thomas Müller-Gronbach (Universität Magdeburg, DE)
- Erich Novak (Universität Jena, DE)
- Knut Petras (Bergische Universität Wuppertal, DE)
- Joseph F. Traub (Columbia University - New York, US)
Contact
The goal of this workshop was to bring together researchers from different communities working on computational aspects of continuous problems.
Continuous computational problems arise in many areas of science and engineering. Examples include path and multivariate integration, function approximation, optimization, as well as differential, integral, and operator equations.
Understanding the complexity of such problems and constructing efficient algorithms is both important and challenging.
The workshop was of a very interdisciplinary nature with invitees from, e.g., computer science, numerical analysis, discrete, applied, and pure mathematics, physics, statistics, and scientific computation. Many of the lectures were presented by Ph.D. students.
Compared to earlier meetings, several very active research areas received more emphasis. These include quantum computing, complexity and tractability of high-dimensional problems, stochastic computation, and quantization, which was an entirely new field for this workshop.
Due to strong connections between the topics treated at this workshop many of the participants initiated new cooperations and research projects. The meeting was the eighth in a series of Dagstuhl-seminars on "Algorithms and Complexity for Continuous Problems". This topic belongs to the focus group research areas of the Working Group 1.1 of the International Federation for Information Processing. The work of the attendants was supported by a variety of funding agencies including the Deutsche Forschungsgemienschaft, the National Science Foundation and the Defense Advanced Research Projects Agency (USA), the Australian Research Council, and the State Committee for Research (Poland).
Selected papers from the workshop will be published in a special issue of the Journal of Complexity.
The following topics were discussed:
- Complexity and Regularization of Ill-Posed Problems
- Non-Linear Approximation
- Tractability of High-Dimensional Numerical Problems
- Quasi-Monte Carlo Methods
- Quantum Computing
- Stochastic: Computation and Quantization
- Global Optimization
- Differential and Integral Equation
- Arvid Bessen (Columbia University - New York, US)
- James M. Calvin (NJIT - Newark, US) [dblp]
- Ronald Cools (KU Leuven, BE) [dblp]
- Stephan Dahlke (Universität Marburg, DE) [dblp]
- Steffen Dereich (TU Berlin, DE) [dblp]
- Josef Dick (UNSW - Sydney, AU) [dblp]
- Nina Golyandina (St. Petersburg University, RU)
- Siegfried Graf (Universität Passau, DE)
- Erika Hausenblas (Universität Salzburg, AT)
- Stefan Heinrich (TU Kaiserslautern, DE) [dblp]
- Peter Hertling (Universität der Bundeswehr - München, DE) [dblp]
- Aicke Hinrichs (Universität Jena, DE) [dblp]
- Norbert Hofmann (Aareal Bank AG - Wiesbaden, DE)
- Matthias U. Horn (Universität Jena, DE)
- Stephen P. Jordan (MIT - Cambridge, US) [dblp]
- Frances Y. Kuo (UNSW - Sydney, AU) [dblp]
- Marek Kwas (Univ. of Inf. Technology & Management - Rzeszow, PL)
- Harald Luschgy (Universität Trier, DE)
- Vitali Maiorov (Technion - Haifa, IL)
- Peter Mathé (Weierstraß Institut - Berlin, DE) [dblp]
- Klaus Meer (University of Southern Denmark - Odense, DK) [dblp]
- Hrushikesh N. Mhaskar (California State Univ. - Los Angeles, US)
- Thomas Müller-Gronbach (Universität Magdeburg, DE) [dblp]
- Andreas Neuenkirch (TU Darmstadt, 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]
- Knut Petras (Bergische Universität Wuppertal, DE)
- Harald Pfeiffer (Universität Jena, DE)
- Leszek Plaskota (University of Warsaw, PL) [dblp]
- Cristian Predescu (University of California - Berkeley, US)
- Klaus Ritter (TU Darmstadt, DE) [dblp]
- Winfried Sickel (Universität Jena, DE) [dblp]
- Ian H. Sloan (UNSW - Sydney, AU) [dblp]
- Anders Szepessy (KTH Royal Institute of Technology, SE)
- Shu Tezuka (Kyushu University, JP)
- Joseph F. Traub (Columbia University - New York, US) [dblp]
- Grzegorz Wasilkowski (University of Kentucky - Lexington, US) [dblp]
- Holger Wendland (Universität Göttingen, DE)
- Carsten Wiegand (TU Kaiserslautern, DE)
- Jakub O. Wojtaszczyk (University of Warsaw, PL)
- Przemyslaw Wojtaszczyk (University of Warsaw, PL)
Related Seminars
- 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 06391: Algorithms and Complexity for Continuous Problems (2006-09-24 - 2006-09-29) (Details)
- Dagstuhl Seminar 09391: Algorithms and Complexity for Continuous Problems (2009-09-20 - 2009-09-25) (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)
