Lower bounds for the complexity of linear functionals in the randomized setting (Q617652): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jco.2010.08.002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCO.2010.08.002 / rank | |||
Normal rank | |||
Latest revision as of 22:40, 9 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds for the complexity of linear functionals in the randomized setting |
scientific article |
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
