Lebesgue constants for Chebyshev thresholding greedy algorithms
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3139051 (Why is no real title available?)
- scientific article; zbMATH DE number 4058317 (Why is no real title available?)
- scientific article; zbMATH DE number 2206777 (Why is no real title available?)
- A remark on greedy approximation in Banach spaces.
- Biorthogonal systems in Banach spaces
- Characterization of 1-almost greedy bases
- Characterization of 1-quasi-greedy bases
- Convergence of some greedy algorithms in Banach spaces
- Efficiency of weak greedy algorithms for m-term approximations
- Greedy algorithm and \(m\)-term trigonometric approximation
- Greedy algorithm for general biorthogonal systems
- Lebesgue constants for the weak greedy algorithm
- Lebesgue inequalities for the greedy algorithm in general bases
- Lebesgue-type inequalities for greedy approximation with respect to quasi-greedy bases
- Lebesgue-type inequalities for quasi-greedy bases
- Nonlinear approximation by trigonometric sums
- On the existence of almost greedy bases in Banach spaces
- Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov
- Weak thresholding greedy algorithms in Banach spaces
Cited in
(4)
This page was built for publication: Lebesgue constants for Chebyshev thresholding greedy algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q824549)