Dagstuhl Seminar Proceedings: Algorithms and Complexity for Continuous Problems 2004
Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub (Eds.): Algorithms and Complexity for Continuous Problems, 26. September - 1. October 2004. IBFI, Schloss Dagstuhl, Germany 2005 Dagstuhl Seminar Proceedings 04401- Stephan Dahlke, Erich Novak, Winfried Sickel: Optimal Approximation of Elliptic Problems II: Wavelet Methods.
- Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub: 04401 Summary - Algorithms and Complexity for Continuous Problems.
- Nina Golyandina: Monte Carlo solution for the Poisson equation on the base of spherical processes with shifted centres.
- Erika Hausenblas: Numerical Approximation of Parabolic Stochastic Partial Differential Equations.
- Norbert Hofmann: Upper Error Bounds for Approximations of Stochastic Differential Equations with Markovian Switching.
- Matthias U. Horn: Optimal algorithms for global optimization in case of unknown Lipschitz constant.
- Erich Novak, Stephan Dahlke, Winfried Sickel: Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings.
- Dirk Nuyens, Ronald Cools: Fast Component-By-Component Construction of Rank-1 Lattice Rules for (Non-)Primes (Part II).
- Knut Petras, Klaus Ritter: On the Complexity of Parabolic Initial Value Problems with Variable Drift.
- Leszek Plaskota: Information-Based Nonlinear Approximation: An Average Case Setting.
- Klaus Ritter, Thomas Müller-Gronbach: Lower Bounds and Non-Uniform Time Discretization for Approximation of Stochastic Heat Equations.
- Grzegorz W. Wasilkowski, Henryk Wozniakowski: Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights; Worst Case Setting.
- Thomas Müller-Gronbach, Erich Novak, Knut Petras, Joseph F. Traub: 04401 Abstracts Collection - Algorithms and Complexity for Continuous.
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-17T202759 by the dblp team