04401 Summary – Algorithms and Complexity for Continuous Problems

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.