Randomized approximation of Sobolev embeddings. II
From MaRDI portal
(Redirected from Publication:731975)
Recommendations
- Randomized approximation of Sobolev embeddings. III
- Randomized approximation of Sobolev embeddings
- Complexity of Sobolev imbeddings and integration in the deterministic and randomized settings
- Random approximation of Sobolev embeddings
- Randomized approximation numbers on Besov classes with mixed smoothness
Cites work
- 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
- scientific article; zbMATH DE number 3870002 (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 3602125 (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?)
- Monte Carlo approximation of weakly singular integral operators
- On dilation operators and sampling numbers
- Random approximation of Sobolev embeddings
- Randomization for continuous problems
- Randomized approximation of Sobolev embeddings
- Randomized approximation of Sobolev embeddings. III
- Sampling numbers and embedding constants
- 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
(16)- Optimal sampling recovery of mixed order Sobolev embeddings via discrete {L}ittlewood--{P}aley type characterizations
- On the complexity of computing the \(L_q\) norm
- Algorithms and complexity for functions on general domains
- The randomized information complexity of elliptic PDE
- Complexity of stochastic integration in Sobolev classes
- Probabilistic Sobolev embeddings, applications to eigenfunctions estimates
- Randomized approximation of Sobolev embeddings
- Discontinuous information in the worst case and randomized settings
- Complexity of Sobolev imbeddings and integration in the deterministic and randomized settings
- Recovery of Sobolev functions restricted to iid sampling
- Stochastic approximation of functions and applications
- The randomized complexity of indefinite integration
- Sampling numbers of smoothness classes via \(\ell^1\)-minimization
- Randomized complexity of parametric integration and the role of adaption. II: Sobolev spaces
- Optimal algorithms for numerical integration: recent results and open problems
- Randomized approximation of Sobolev embeddings. III
This page was built for publication: Randomized approximation of Sobolev embeddings. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q731975)