License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.04401.14
URN: urn:nbn:de:0030-drops-1526
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2005/152/
Go to the corresponding Portal |
Wasilkowski, Gregorz W. ;
Wozniakowski, Henryk
Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights; Worst Case Setting
Abstract
We present polynomial-time algorithms for multivariate problems defined over tensor product
spaces of finite order. That is, algorithms that solve the problem with error not exceeding \epsilon
at cost bounded by C d^q \epsilon^{-1}, where
d denotes the number of variables.
BibTeX - Entry
@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/opus/volltexte/2005/152},
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}
}
Keywords: |
|
Multivariate integration , multivariate approximation , complexity , polynomial-time algorithms , finite-order weights |
Collection: |
|
04401 - Algorithms and Complexity for Continuous Problems |
Issue Date: |
|
2005 |
Date of publication: |
|
19.04.2005 |