License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-1530
URL: http://drops.dagstuhl.de/opus/volltexte/2005/153/
Go to the corresponding Portal


Müller-Gronbach, Thomas ; Novak, Erich ; Petras, Knut ; Traub, Joseph F.

04401 Summary -- Algorithms and Complexity for Continuous Problems

pdf-format:
Document 1.pdf (142 KB)


Abstract

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. For more details, see the pdf-file with the same title.

BibTeX - Entry

@InProceedings{mllergronbach_et_al:DSP:2005:153,
  author =	{Thomas M{\"u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub},
  title =	{04401 Summary -- Algorithms and Complexity for Continuous Problems},
  booktitle =	{Algorithms and Complexity for Continuous Problems},
  year =	{2005},
  editor =	{Thomas M{\"u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub},
  number =	{04401},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2005/153},
  annote =	{Keywords: Complexity and Regularization of Ill-Posed Problems , Non-Linear Approximation , Tractability of High-Dimensional Numerical Problems}
}

Keywords: Complexity and Regularization of Ill-Posed Problems , Non-Linear Approximation , Tractability of High-Dimensional Numerical Problems
Freie Schlagwörter (deutsch): Quasi-Monte Carlo Methods , Quantum Computing , Stochastic Computation and Quantization , Global Optimization , Differential and Integral Equation
Seminar: 04401 - Algorithms and Complexity for Continuous Problems
Issue Date: 2005
Date of publication: 19.04.2005


DROPS-Home | Fulltext Search | Imprint Published by LZI