LZI - Schloss Dagstuhl - Talks + Materials of Seminar 06391

Collector buttons:

Seminar 06391
Algorithms and Complexity for Continuous Problems

S. Dahlke (Univ. Marburg, DE), K. Ritter (TU Darmstadt, DE), I. H. Sloan (Univ. of New South Wales, AU), J. F. Traub (Columbia Univ., US)

Seminar Wide Materials

Algorithms and Complexity of Continuous Problems

Abstracts:

Slides:

	Upload or overwrite a document file and/or change title of talk


	Due to caching problems of microsofts internet explorer concerning dynamic webpages, sometimes newly uploaded files are not shown. By pressing [CTRL]+[F5], the page is completely reloaded.

Howard Barnum , Los Alamos National Lab.

Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries

Abstracts:

DROPS-Submission:

Arvid Bessen , Columbia University

Complexity of the Schrödinger Equation with Finite-Order Weights

Abstracts:

Slides:

Volker Bosserhoff , Univ. der Bundeswehr - Neubiberg

Jim Calvin , NJIT - Newark

Lower Bound for Average-Case Complexity of Optimization for Brownian Bridge with Adaptive Stopping Rules

Abstracts:

Slides:

Hui Cao , RICAM - Linz

Balancing principle for solving naturally linearized Elliptic Cauchy problem

Abstracts:

Slides:

Ronald Cools , Katholieke Universiteit Leuven

Quasi-Monte Carlo integration of functions of unbounded variation

Abstracts:

Slides:

Jakob Creutzig , TU Darmstadt

Nonlinear Approximation of stochastic processes

Abstracts:

Slides:

Stephan Dahlke , Universität Marburg

Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings: Frames

Abstracts:

Ronald A. DeVore , University of South Carolina

A Taste of Compressed Sensing

Abstracts:

Josef Dick , Univ. of New South Wales

Quasi-Monte Carlo rules achieving arbitrary high convergence order

Abstracts:

Slides:

Stefan Geiss , University of Jyväskylä

On discrete-time approximation of BSDE's with non-Lipschitz terminal condition

Abstracts:

Michael Gnewuch , Universität Kiel

Generalized Tractability of Linear Tensor Product Problems -The Restricted Setting

Abstracts:

Maciej Gocwin , AGH Univ. of Science & Technology-Krakow

On the complexity of searching maximum of a function on a quantum computer

Abstracts:

Stefan Heinrich , TU Kaiserslautern

Randomized Information Complexity of Elliptic PDE: The $L_p$ Case

Abstracts:

Aicke Hinrichs , Universität Jena

Cubature Formulas with Few Points for Symmetric Measures

Abstracts:

Slides:

Peter Hoyer , University of Calgary

Boleslaw Z. Kacewicz , AGH Univ. of Science & Technology-Krakow

Almost tight bounds on the randomized and quantum complexity of initial-value problems

Abstracts:

Alexander Keller , Universität Ulm

Towards Simulating Markov Chains by using Rank-1 Lattice Sequences

Abstracts:

Peter Kritzer , Universität Salzburg

Digital Nets and Multivariate Approximation

Abstracts:

Slides:

Frances Kuo , Univ. of New South Wales

Lattice-Nystrom Method for Fredholm Integral Equation of the Second Kind

Abstracts:

Slides:

Shuai Lu , RICAM - Linz

Sparsity reconstruction by the standard Tikhonov method

Abstracts:

Slides:

Peter Mathé , Weierstraß Institut - Berlin

Smoothness beyond Differentiability

Abstracts:

Slides:

Klaus Meer , Univ. of Southern Denmark - Odense

The word problem for a class of real groups with infinite presentations

Abstracts:

Slides:

DROPS-Submission:

Hrushikesh N. Mhaskar , California State Univ. - Los Angeles

Quadrature formulas and localized linear polynomial operators on the sphere

Abstracts:

Bernhard Milla , TU Kaiserslautern

Thomas Müller-Gronbach , Universität Magdeburg

Complexity of Weak Approximation of SDEs

Abstracts:

Slides:

Andreas Neuenkirch , TU Darmstadt

Systems of SDEs with Additive Fractional Noise: Optimal Uniform Approximation

Abstracts:

Erich Novak , Universität Jena

Simple Monte Carlo and the Metropolis Algorithm

Abstracts:

Slides:

Dirk Nuyens , Katholieke Universiteit Leuven

Lattice sequences in finance

Abstracts:

Slides:

Anargyros Papageorgiou , Columbia University

On the complexity of approximating the minimum eigenvalue of $-\Delta +q$

Abstracts:

Slides:

Sergei V. Pereverzev , RICAM - Linz

Adaptive Regularization Algorithms in Learning Theory

Abstracts:

Slides:

Friedrich Pillichshammer , University of Linz

The construction of good extensible rank-1 lattices

Abstracts:

Slides:

Leszek Plaskota , University of Warsaw

Thorsten Raasch , Universität Marburg

Adaptive Wavelet Schemes for Linear Parabolic Problems

Abstracts:

Slides:

Klaus Ritter , TU Darmstadt

Wolfgang Ch. Schmid , Universität Salzburg

Generalized Polynomial Lattices with Large Figure of Merit

Abstracts:

Reinhold Schneider , Universität Kiel

Convergence of the Coupled Cluster Method for the Electronic Schro"dinger Equation

Abstracts:

Slides:

Winfried Sickel , Universität Jena

Optimal approximation of elliptic problems by linear and nonlinear mappings

Abstracts:

Slides:

Krzysztof Sikorski , University of Utah

Selected Nonlinear Problems

Abstracts:

Slides:

Ian H. Sloan , Univ. of New South Wales

Breaking the curse of dimensionality for integration over product of spheres

Abstracts:

Rob Stevenson , Utrecht University

Optimality of a standard adaptive finite element method

Abstracts:

Marek Szczesny , AGH Univ. of Science & Technology-Krakow

Complexity of Initial-Value Problems for Ordinary Differential Equations of Order k

Abstracts:

Shu Tezuka , Kyushu University

Discrepancy between QMC and RQMC

Abstracts:

Joseph F. Traub , Columbia University

Jan Vybiral , Universität Jena

Function spaces on unit cube and sampling numbers

Abstracts:

Slides:

Tim Wagner , TU Darmstadt

Non-Equidistant Time Discretization of Stochastic Heat Equations

Abstracts:

Slides:

Grzegorz Wasilkowski , University of Kentucky

$L_\infty$ Approximation over Reproducing Kernel Hilbert Spaces; Worst Case Setting

Abstracts:

Ben J. Waterhouse , Univ. of New South Wales

Construction of extensible Korobov Rules

Abstracts:

Slides:

Przemyslaw Wojtaszczyk , University of Warsaw

Anisotropic smoothness spaces via level sets

Abstracts:

Henryk Wozniakowski , Columbia University

On Generalized Tractability for Multivariate Problems

Abstracts:

Copyright

This webpage and the material that is made available on this webpage is licensed under a
Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 Unported License.

The CC by-nc-nd license allows you to copy, distribute and transmit the work under the following conditions:

Attribution: You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
Noncommercial: You may not use this work for commercial purposes.
No Derivative Works: You may not alter, transform, or build upon this work.

Seminar 06391 Algorithms and Complexity for Continuous Problems

Copyright

Seminar 06391
Algorithms and Complexity for Continuous Problems