Random approximation of Sobolev embeddings

DOI10.1016/0885-064X(91)90036-WzbMath0735.65004OpenAlexW2054607986MaRDI QIDQ1179456

Peter Mathé

Publication date: 26 June 1992

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0885-064x(91)90036-w

zbMATH Keywords

Sobolev spacesSobolev embeddingsrandom methodsinformation-based complexityerror criterionrandom approximationMonte-Carlo methodsorder of magnitudes-numbersapproximating functions

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Sobolev spaces and other spaces of ``smooth functions, embedding theorems, trace theorems (46E35) Algorithms for approximation of functions (65D15) Complexity and performance of numerical algorithms (65Y20) Approximations and expansions (41A99)

Related Items (21)

Kolmogorov and Linear Widths on Generalized Besov Classes in the Monte Carlo Setting ⋮ Recovery of Sobolev functions restricted to iid sampling ⋮ Exact asymptotic orders of various randomized widths on Besov classes ⋮ Randomized approximation numbers on Besov classes with mixed smoothness ⋮ Estimates of probabilistic widths of the diagonal operator of finite-dimensional sets with the Gaussian measure ⋮ The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods ⋮ Optimal Monte Carlo methods for \(L^2\)-approximation ⋮ Optimal linear randomized methods for linear operators in Hilbert spaces ⋮ Monte Carlo methods for uniform approximation on periodic Sobolev spaces with mixed smoothness ⋮ Lower bounds for the complexity of Monte Carlo function approximation ⋮ A minimax principle for the optimal error of Monte Carlo methods ⋮ The Monte Carlo Complexity of Fredholm Integral Equations ⋮ Discontinuous information in the worst case and randomized settings ⋮ Optimal algorithms for diagonal operators on N-widths in different computational setting ⋮ Approximation characteristics for diagonal operators in different computational settings ⋮ Breaking the curse for uniform approximation in Hilbert spaces via Monte Carlo methods ⋮ Randomized approximation of Sobolev embeddings. II ⋮ The information-based complexity of approximation problem by adaptive Monte Carlo methods ⋮ On the power of standard information for \(L_{\infty}\) approximation in the randomized setting ⋮ Linear average and stochastic \(n\)-widths of Besov embeddings on Lipschitz domains ⋮ The power of standard information for multivariate approximation in the randomized setting

Cites Work

• s-numbers in information-based complexity
• Orthogonal projections are optimal algorithms
• Probability methods for approximations in stochastic control and for elliptic equations
• Variational properties of averaged equations for periodic media
• Deterministic and stochastic error bounds in numerical analysis
• Eigenvalue distribution of compact operators
• Quotients of Banach Spaces of Cotype q
• Séries de variables aléatoires vectorielles indépendantes et propriétés géométriques des espaces de Banach
• Equivalent Norms for Sobolev Spaces
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Random approximation of Sobolev embeddings