Complexity of Sobolev imbeddings and integration in the deterministic and randomized settings
DOI10.1360/012010-569zbMATH Open1499.46072OpenAlexW2332259200MaRDI QIDQ5017646FDOQ5017646
Authors: Pei-Xin Ye
Publication date: 17 December 2021
Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1360/012010-569
Recommendations
Numerical integration (65D30) Multidimensional problems (41A63) Approximate quadratures (41A55) Sobolev spaces and other spaces of ``smooth functions, embedding theorems, trace theorems (46E35) Rate of convergence, degree of approximation (41A25)
Cited In (9)
- Randomized approximation of Sobolev embeddings. II
- Randomized approximation of Sobolev embeddings. III
- Optimal error bound of restricted Monte Carlo integration on anisotropic Sobolev classes
- Complexity of stochastic integration in Sobolev classes
- Computational complexity of the integration problem for anisotropic classes
- Randomized approximation of Sobolev embeddings
- Randomized complexity of parametric integration and the role of adaption. II: Sobolev spaces
- On the complexity of computing the \(L_q\) norm
- Complexity of deterministic and randomized methods for multivariate integration problems for the class HpΛ(Id)
This page was built for publication: Complexity of Sobolev imbeddings and integration in the deterministic and randomized settings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5017646)