The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods
From MaRDI portal
Publication:933418
DOI10.1016/j.jco.2007.11.001zbMath1148.41030OpenAlexW2035255232MaRDI QIDQ933418
Publication date: 21 July 2008
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2007.11.001
Monte Carlo methods (65C05) Multidimensional problems (41A63) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) Numerical approximation and computational geometry (primarily algorithms) (65D99)
Related Items (5)
Kolmogorov and Linear Widths on Generalized Besov Classes in the Monte Carlo Setting ⋮ Exact asymptotic orders of various randomized widths on Besov classes ⋮ Randomized approximation numbers on Besov classes with mixed smoothness ⋮ Monte Carlo methods for uniform approximation on periodic Sobolev spaces with mixed smoothness ⋮ The information-based complexity of approximation problem by adaptive Monte Carlo methods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integration error for multivariate functions from anisotropic classes
- Random approximation of Sobolev embeddings
- Lower bounds for the complexity of Monte Carlo function approximation
- Deterministic and stochastic error bounds in numerical analysis
- Linear widths of Hölder-Nikol'skij classes of periodic functions of several variables
- Average-case analysis of numerical problems
- Tractability of approximation for weighted Korobov spaces on classical and quantum computers
- Monte Carlo approximation of weakly singular integral operators
- Sparse grids
- Complexity of deterministic and randomized methods for multivariate integration problems for the class HpΛ(Id)
This page was built for publication: The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods
