Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov
From MaRDI portal
Publication:2339770
Recommendations
Cited in
(16)- Lebesgue constants for Chebyshev thresholding greedy algorithms
- The best m-term approximation with respect to polynomials with constant coefficients
- Rate of convergence of thresholding greedy algorithms
- Lebesgue inequalities for the greedy algorithm in general bases
- Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces
- On certain subspaces of \(\ell_p\) for \(0 < p \le 1\) and their applications to conditional quasi-greedy bases in \(p\)-Banach spaces
- Kolmogorov width and approximate rank
- Lebesgue inequalities for Chebyshev thresholding greedy algorithms
- Greedy approximations with regard to bases
- A survey on compressed sensing approach to systems and control
- Nonlinear trigonometric approximations of multivariate function classes
- Characterization of weight-semi-greedy bases
- Weight-almost greedy bases
- Greedy approximation
- New parameters and Lebesgue-type estimates in greedy approximation
- scientific article; zbMATH DE number 2065342 (Why is no real title available?)
This page was built for publication: Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339770)