Greedy approximation of characteristic functions
From MaRDI portal
Publication:605979
DOI10.1134/S0081543810020215zbMath1207.41014MaRDI QIDQ605979
Publication date: 15 November 2010
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0081543810020215
41A30: Approximation by other special function classes
Cites Work
- Relaxation in greedy approximation
- Entropy numbers, s-numbers, and eigenvalue problems
- Nonlinear Kolmogorov widths
- Rates of convex approximation in non-Hilbert spaces
- Nonlinear approximation by trigonometric sums
- Greedy algorithms with regard to multivariate systems with special structure
- Universal bases and greedy algorithms for anisotropic function classes
- On best \(m\)-term approximations and the entropy of sets in the space \(L^ 1\)
- Some remarks on greedy algorithms
- Weak greedy algorithms
- Metric entropy of some classes of sets with differentiable boundaries
- Greedy approximation
- Metric entropy and approximation
- Greedy algorithms in Banach spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item