Optimal Monte Carlo Methods for L²-Approximation
From MaRDI portal
Publication:6286596
Monte Carlo methods (65C05) Complexity and performance of numerical algorithms (65Y20) Numerical integration (65D30) Analysis of algorithms and problem complexity (68Q25) Multidimensional problems (41A63) Numerical analysis (65-XX) Algorithms for approximation of functions (65D15) Rate of convergence, degree of approximation (41A25)
Abstract: We construct Monte Carlo methods for the -approximation in Hilbert spaces of multivariate functions sampling no more than function values of the target function. Their errors catch up with the rate of convergence and the preasymptotic behavior of the error of any algorithm sampling pieces of arbitrary linear information, including function values.
This page was built for publication: Optimal Monte Carlo Methods for $L^2$-Approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6286596)
