Dagstuhl-Seminar 00391
Algorithms and Complexity for Continuous Problems
( 24. Sep – 29. Sep, 2000 )
(zum Vergrößern in der Bildmitte klicken)
Permalink
Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite:
https://www.dagstuhl.de/00391
Organisatoren
- G. Wasilkowski (Lexington)
- J. Traub (New York)
- S. Heinrich (Kaiserslautern)
- S. Pereverzev (Kiew)
Kontakt
Continuous computational problems arise in diverse areas of science and engineering. There has been an increasing interest in computational aspects of multivariate problems. Examples include path and multivariate integration, function approximation, optimization, and operator equations. Understanding the complexity of such problems and construction of efficient algorithms is both important and challenging.
The main focus of this seminar will be on the complexity of such high dimensional problems and on their tractability. Efficient or, ideally, optimal algorithms will be presented. Since Monte Carloand/or quasi-Monte Carlo algorithms are often used for such problems, their efficiency will also be addressed. Models of computations and various settings (e.g., worst case, average case, or probabilistic) are important part of the complexity study and these will be discussed as well.
- G. Wasilkowski (Lexington)
- J. Traub (New York)
- S. Heinrich (Kaiserslautern)
- S. Pereverzev (Kiew)
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 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 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)
- Dagstuhl-Seminar 27341: Algorithms and Complexity for Continuous Problems (2027-08-22 - 2027-08-27) (Details)
