Randomized approximation of Sobolev embeddings. III

DOI10.1016/J.JCO.2009.04.002MaRDI QIDQ731976zbMATH OpenOpenAlexFDO

Authors Stefan Heinrich

Publication date 9 October 2009

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

Full work available at URL https://doi.org/10.1016/j.jco.2009.04.002

zbMATH Keywords

samplingrandomized algorithmlower boundsapproximationSobolev space

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)

Recommendations

• Randomized approximation of Sobolev embeddings. II
• Randomized approximation of Sobolev embeddings
• Random approximation of Sobolev embeddings
• Sparse polynomial approximation in positive order Sobolev spaces with bounded mixed derivatives and applications to elliptic problems with random loading
• Complexity of Sobolev imbeddings and integration in the deterministic and randomized settings

Cites work

• scientific article; zbMATH DE number 3870002 (Why is no real title available?)
• scientific article; zbMATH DE number 4011016 (Why is no real title available?)
• scientific article; zbMATH DE number 3696612 (Why is no real title available?)
• scientific article; zbMATH DE number 44104 (Why is no real title available?)
• scientific article; zbMATH DE number 515830 (Why is no real title available?)
• scientific article; zbMATH DE number 3329342 (Why is no real title available?)
• Characterization of the law of the iterated logarithm in Banach spaces
• Deterministic and stochastic error bounds in numerical analysis
• Entropy Numbers and Approximation Numbers in Function Spaces, II
• Equivalent Norms for Sobolev Spaces
• Function spaces in Lipschitz domains and on Lipschitz manifolds. Characteristic functions as pointwise multipliers.
• Function spaces in Lipschitz domains and optimal rates of convergence for sampling
• Monte Carlo approximation of weakly singular integral operators
• Optimal approximation of elliptic problems by linear and nonlinear mappings. I
• Optimal approximation of elliptic problems by linear and nonlinear mappings. II
• Optimal approximation of elliptic problems by linear and nonlinear mappings. III: Frames
• Randomized approximation of Sobolev embeddings
• Randomized approximation of Sobolev embeddings. II
• Sampling numbers and function spaces
• The randomized information complexity of elliptic PDE
• Theory of function spaces. III
• Tractability of multivariate problems. Volume I: Linear information

Cited in

(12)

• Optimal approximation of elliptic problems by linear and nonlinear mappings. IV: Errors in \(L_{2}\) and other norms
• Algorithms and complexity for functions on general domains
• Randomized approximation of Sobolev embeddings. II
• Discontinuous information in the worst case and randomized settings
• Randomized complexity of parametric integration and the role of adaption. I: Finite dimensional case
• Probabilistic Sobolev embeddings, applications to eigenfunctions estimates
• The randomized complexity of indefinite integration
• Random points are optimal for the approximation of Sobolev functions
• Randomized approximation of Sobolev embeddings
• On the complexity of computing the \(L_q\) norm
• Recovery of Sobolev functions restricted to iid sampling
• Complexity of Sobolev imbeddings and integration in the deterministic and randomized settings

This page was built for publication: Randomized approximation of Sobolev embeddings. III

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731976)