Linear information versus function evaluations for L₂-approximation
From MaRDI portal
Linear information versus function evaluations for \(L 2\)-approximation
Recommendations
- Function values are enough for \(L_2\)-approximation
- Function values are enough for \(L_2\)-approximation. II
- Approximation of Functions from a Hilbert Space Using Function Values or General Linear Information
- Exponential tractability of \(L_2\)-approximation with function values
- On the power of standard information for multivariate approximation in the worst case setting
Cites work
- scientific article; zbMATH DE number 44104 (Why is no real title available?)
- scientific article; zbMATH DE number 50734 (Why is no real title available?)
- Nonlinear methods of approximation
- On the power of standard information for multivariate approximation in the worst case setting
- On the power of standard information for weighted approximation
- Optimal approximation of elliptic problems by linear and nonlinear mappings. I
- Sampling numbers and function spaces
- The power of standard information for multivariate approximation in the randomized setting
- Unconditional bases are optimal bases for data compression and for statistical estimation
Cited in
(26)- Approximation of functions with small mixed smoothness in the uniform norm
- Random sections of ellipsoids and the power of random information
- Approximation of additive random fields based on standard information: average case and probabilistic settings
- Optimal sampling points in reproducing kernel Hilbert spaces
- New averaging technique for approximating weighted integrals
- Generalized sparse grid interpolation based on the fast discrete Fourier transform
- On the power of standard information for \(L_{\infty}\) approximation in the randomized setting
- On the power of standard information for multivariate approximation in the worst case setting
- New lower bounds for the integration of periodic functions
- Liberating the dimension for function approximation: standard information
- Tractability of multivariate problems for standard and linear information in the worst case setting. I.
- Exponential tractability of \(L_2\)-approximation with function values
- Optimal Monte Carlo methods for \(L^2\)-approximation
- Enhancement of the algebraic precision of a linear operator and consequences under positivity
- Function values are enough for \(L_2\)-approximation. II
- Liberating the dimension for function approximation and integration
- Lattice algorithms for multivariate \(L_{\infty}\) approximation in the worst-case setting
- On the power of standard information for tractability for \(L_2\)-approximation in the average case setting
- Function values are enough for \(L_2\)-approximation
- Worst-case recovery guarantees for least squares approximation using random samples
- On the minimal cost of approximating linear problems based on information with deterministic noise
- A new upper bound for sampling numbers
- Lower bounds for integration and recovery in \(L_2\)
- A sharp upper bound for sampling numbers in \(L_2\)
- On the power of standard information for tractability for \(L_{\infty}\) approximation of periodic functions in the worst case setting
- Tractability of multivariate problems for standard and linear information in the worst case setting. II
This page was built for publication: Linear information versus function evaluations for \(L_2\)-approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935085)
