Lower bounds for the complexity of linear functionals in the randomized setting (Q617652)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds for the complexity of linear functionals in the randomized setting |
scientific article; zbMATH DE number 5840229
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds for the complexity of linear functionals in the randomized setting |
scientific article; zbMATH DE number 5840229 |
Statements
Lower bounds for the complexity of linear functionals in the randomized setting (English)
0 references
21 January 2011
0 references
The authors establish the sharpness conditions for the exponent in the approximation estimator from \textit{A.~Hinrichs} [J. Complexity 26, No.~2, 125--134 (2010; Zbl 1191.65003)]. In particular it is proved the sharpness of the exponent ``\dots for tensor product Hilbert spaces whose univariate reproducing kernel is decomposable and univariate integration is not trivial for the two parts of the decomposition.''
0 references
optimal Monte Carlo method
0 references
integration over reproducing kernel Hilbert spaces
0 references
decomposable kernels
0 references
complexity in the randomized settings
0 references
0 references
