The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods (Q933418): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jco.2007.11.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035255232 / rank | |||
Normal rank | |||
Revision as of 01:22, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods |
scientific article |
Statements
The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods (English)
0 references
21 July 2008
0 references
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.
0 references
Monte Carlo method
0 references
Sobolev space with bounded mixed derivative
0 references
asymptotic order
0 references
