Thomas Müller-Gronbach, Erich Novak, Knut Petras, and Joseph F. Traub. 04401 Abstracts Collection – Algorithms and Complexity for Continuous. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{mullergronbach_et_al:DagSemProc.04401.1, author = {M\"{u}ller-Gronbach, Thomas and Novak, Erich and Petras, Knut and Traub, Joseph F.}, title = {{04401 Abstracts Collection – Algorithms and Complexity for Continuous}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--21}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.1}, URN = {urn:nbn:de:0030-drops-1545}, doi = {10.4230/DagSemProc.04401.1}, annote = {Keywords: Complexity and regularization of ill-posed problems , nonlinear approximation , tractability of high-dimensional numerical problems quantum computing , stochastic computation and quantization , global optimization , differential and integral equations} }
Thomas Müller-Gronbach, Erich Novak, Knut Petras, and Joseph F. Traub. 04401 Summary – Algorithms and Complexity for Continuous Problems. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{mullergronbach_et_al:DagSemProc.04401.2, author = {M\"{u}ller-Gronbach, Thomas and Novak, Erich and Petras, Knut and Traub, Joseph F.}, title = {{04401 Summary – Algorithms and Complexity for Continuous Problems}}, booktitle = {Algorithms and Complexity for Continuous Problems}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.2}, URN = {urn:nbn:de:0030-drops-1530}, doi = {10.4230/DagSemProc.04401.2}, annote = {Keywords: Complexity and Regularization of Ill-Posed Problems , Non-Linear Approximation , Tractability of High-Dimensional Numerical Problems Quasi-Monte Carlo Methods , Quantum Computing , Stochastic Computation and Quantization , Global Optimization , Differential and Integral Equation} }
Dirk Nuyens and Ronald Cools. Fast Component-By-Component Construction of Rank-1 Lattice Rules for (Non-)Primes (Part II). In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{nuyens_et_al:DagSemProc.04401.3, author = {Nuyens, Dirk and Cools, Ronald}, title = {{Fast Component-By-Component Construction of Rank-1 Lattice Rules for (Non-)Primes (Part II)}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--26}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.3}, URN = {urn:nbn:de:0030-drops-1486}, doi = {10.4230/DagSemProc.04401.3}, annote = {Keywords: numerical integration , cubature/quadrature , rank-1 lattice , component-by-component construction , fast algorithm} }
Harald Luschgy and Gilles Pagès. Functional Quantization and Entropy for Stochastic Processes. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{luschgy_et_al:DagSemProc.04401.4, author = {Luschgy, Harald and Pag\`{e}s, Gilles}, title = {{Functional Quantization and Entropy for Stochastic Processes}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--15}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.4}, URN = {urn:nbn:de:0030-drops-1446}, doi = {10.4230/DagSemProc.04401.4}, annote = {Keywords: Functional quantization , entropy , product quantizers} }
Leszek Plaskota. Information-Based Nonlinear Approximation: An Average Case Setting. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{plaskota:DagSemProc.04401.5, author = {Plaskota, Leszek}, title = {{Information-Based Nonlinear Approximation: An Average Case Setting}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--1}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.5}, URN = {urn:nbn:de:0030-drops-1504}, doi = {10.4230/DagSemProc.04401.5}, annote = {Keywords: average case setting , nonlinear approximation , information-based comlexity} }
Klaus Ritter and Thomas Müller-Gronbach. Lower Bounds and Non-Uniform Time Discretization for Approximation of Stochastic Heat Equations. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{ritter_et_al:DagSemProc.04401.6, author = {Ritter, Klaus and M\"{u}ller-Gronbach, Thomas}, title = {{Lower Bounds and Non-Uniform Time Discretization for Approximation of Stochastic Heat Equations}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--37}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.6}, URN = {urn:nbn:de:0030-drops-1518}, doi = {10.4230/DagSemProc.04401.6}, annote = {Keywords: Stochastic heat equation , Non-uniform time discretization , minimal errors , upper and lower bounds} }
Nina Golyandina. Monte Carlo solution for the Poisson equation on the base of spherical processes with shifted centres. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{golyandina:DagSemProc.04401.7, author = {Golyandina, Nina}, title = {{Monte Carlo solution for the Poisson equation on the base of spherical processes with shifted centres}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--8}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.7}, URN = {urn:nbn:de:0030-drops-1393}, doi = {10.4230/DagSemProc.04401.7}, annote = {Keywords: Poisson equation , Laplace operator , Monte Carlo solution , spherical process , random walk on spheres , rate of convergence} }
Erika Hausenblas. Numerical Approximation of Parabolic Stochastic Partial Differential Equations. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{hausenblas:DagSemProc.04401.8, author = {Hausenblas, Erika}, title = {{Numerical Approximation of Parabolic Stochastic Partial Differential Equations}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.8}, URN = {urn:nbn:de:0030-drops-1417}, doi = {10.4230/DagSemProc.04401.8}, annote = {Keywords: Stochastic Partial Differential Equations , Stochastic evolution Equations , Numerical Approximation , implicit Euler scheme} }
Klaus Meer and Gregorio Malajovich. On the Complexity of Computing Multi-Homogeneous BÃƒÂ©zout Numbers. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{meer_et_al:DagSemProc.04401.9, author = {Meer, Klaus and Malajovich, Gregorio}, title = {{On the Complexity of Computing Multi-Homogeneous B\~{A}ƒ\^{A}©zout Numbers}}, booktitle = {Algorithms and Complexity for Continuous Problems}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.9}, URN = {urn:nbn:de:0030-drops-1460}, doi = {10.4230/DagSemProc.04401.9}, annote = {Keywords: multi-homogeneous B\~{A}ƒ\^{A}©zout numbers , number of roots of polynomials , approximation algorithms} }
Knut Petras and Klaus Ritter. On the Complexity of Parabolic Initial Value Problems with Variable Drift. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{petras_et_al:DagSemProc.04401.10, author = {Petras, Knut and Ritter, Klaus}, title = {{On the Complexity of Parabolic Initial Value Problems with Variable Drift}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--24}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.10}, URN = {urn:nbn:de:0030-drops-1495}, doi = {10.4230/DagSemProc.04401.10}, annote = {Keywords: Partial differential equations , parabolic problems , Smolyak method , optimal methods} }
Matthias U. Horn. Optimal algorithms for global optimization in case of unknown Lipschitz constant. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{horn:DagSemProc.04401.11, author = {Horn, Matthias U.}, title = {{Optimal algorithms for global optimization in case of unknown Lipschitz constant}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--22}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.11}, URN = {urn:nbn:de:0030-drops-1430}, doi = {10.4230/DagSemProc.04401.11}, annote = {Keywords: Global optimization , Lipschitz functions , optimal rate of convergence , complexity} }
Erich Novak, Stephan Dahlke, and Winfried Sickel. Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{novak_et_al:DagSemProc.04401.12, author = {Novak, Erich and Dahlke, Stephan and Sickel, Winfried}, title = {{Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings}}, booktitle = {Algorithms and Complexity for Continuous Problems}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.12}, URN = {urn:nbn:de:0030-drops-1471}, doi = {10.4230/DagSemProc.04401.12}, annote = {Keywords: elliptic operator equation , worst case error , linear approximation method , nonlinear approximation method , best n-term approximation Bernstein widths , manifold widths} }
Stephan Dahlke, Erich Novak, and Winfried Sickel. Optimal Approximation of Elliptic Problems II: Wavelet Methods. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{dahlke_et_al:DagSemProc.04401.13, author = {Dahlke, Stephan and Novak, Erich and Sickel, Winfried}, title = {{Optimal Approximation of Elliptic Problems II: Wavelet Methods}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.13}, URN = {urn:nbn:de:0030-drops-1381}, doi = {10.4230/DagSemProc.04401.13}, annote = {Keywords: Elliptic operator equations , worst case error , best n-term approximation , wavelets , Besov regularity} }
Gregorz W. Wasilkowski and Henryk Wozniakowski. Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights; Worst Case Setting. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{wasilkowski_et_al:DagSemProc.04401.14, author = {Wasilkowski, Gregorz W. and Wozniakowski, Henryk}, title = {{Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights; Worst Case Setting}}, booktitle = {Algorithms and Complexity for Continuous Problems}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.14}, URN = {urn:nbn:de:0030-drops-1526}, doi = {10.4230/DagSemProc.04401.14}, annote = {Keywords: Multivariate integration , multivariate approximation , complexity , polynomial-time algorithms , finite-order weights} }
Siegfried Graf and Harald Luschgy. Quantization of self-similar Probabilities. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{graf_et_al:DagSemProc.04401.15, author = {Graf, Siegfried and Luschgy, Harald}, title = {{Quantization of self-similar Probabilities}}, booktitle = {Algorithms and Complexity for Continuous Problems}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.15}, URN = {urn:nbn:de:0030-drops-1402}, doi = {10.4230/DagSemProc.04401.15}, annote = {Keywords: quantization , self-similar probabilities} }
Norbert Hofmann. Upper Error Bounds for Approximations of Stochastic Differential Equations with Markovian Switching. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{hofmann:DagSemProc.04401.16, author = {Hofmann, Norbert}, title = {{Upper Error Bounds for Approximations of Stochastic Differential Equations with Markovian Switching}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--2}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2005}, volume = {4401}, editor = {Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.16}, URN = {urn:nbn:de:0030-drops-1422}, doi = {10.4230/DagSemProc.04401.16}, annote = {Keywords: stochastic differential equations with Markovian switching , Markov chains , numerical methods , Euler scheme , Milstein scheme} }
Feedback for Dagstuhl Publishing