DagSemProc.04401.14.pdf
- Filesize: 0.56 MB
- 45 pages
Document
Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights; Worst Case Setting
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 4401
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2005-04-19
Cite As Get BibTex
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)
https://doi.org/10.4230/DagSemProc.04401.14
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.
Subject Classification
Keywords
- Multivariate integration
- multivariate approximation
- complexity
- polynomial-time algorithms
- finite-order weights
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads