Bernstein Numbers and Lower Bounds for the Monte Carlo Error

DOI10.1007/978-3-319-33507-0_24zbMath1356.65011OpenAlexW2475426136MaRDI QIDQ2957051

Robert J. Kunsch

Publication date: 20 January 2017

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-33507-0_24

zbMATH Keywords

algorithmBanach spacesMonte Carlocurse of dimensionalityGaussian measuresapproximation of smooth functionsBernstein numberslower error boundsBernstein widths

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Approximation by operators (in particular, by integral operators) (41A35) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Related Items

Breaking the curse for uniform approximation in Hilbert spaces via Monte Carlo methods

Cites Work

• Unnamed Item
• Unnamed Item
• Bernstein \(n\)-width of Besov embeddings on Lipschitz domains
• Tractability of multivariate problems. Volume I: Linear information
• Sections of the unit ball of \(\ell ^ n_ p\)
• Optimal linear randomized methods for linear operators in Hilbert spaces
• Lower bounds for the complexity of Monte Carlo function approximation
• Approximation of infinitely differentiable multivariate functions is intractable
• On the approximate calculation of multiple integrals
• The surface measure and cone measure on the sphere of ℓ_{𝑝}ⁿ
• The Brunn-Minkowski inequality