The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods
Approximation orders of functions by Monte Carlo methods are considered in this paper. The so-called information based complexity of the problem is of special interest. The approximands are from Sobolev spaces where mixed partial derivatives are assumed to be bounded. The approximation orders are stated explicity. The proof of the main theorem uses Vitali Maiorov's results with respect to discretization.
Sobolev space with bounded mixed derivative
scientific article; zbMATH DE number 5303164
scientific article