Lower bounds for the complexity of linear functionals in the randomized setting (Q617652): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jco.2010.08.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1974657772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Reproducing Kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variational properties of averaged equations for periodic media / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal importance sampling for the approximation of integrals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic and stochastic error bounds in numerical analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intractability results for integration and discrepancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of multivariate problems. Volume I: Linear information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability of multivariate problems. Volume II: Standard information for functionals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of standard information for multivariate approximation in the randomized setting / rank
 
Normal rank

Latest revision as of 17:17, 3 July 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
    0 references
    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
    0 references
    0 references
    0 references
    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