Lebesgue constants for Chebyshev thresholding greedy algorithms
DOI10.1186/S13660-018-1694-YzbMATH Open1497.41015OpenAlexW2802480597MaRDI QIDQ824549FDOQ824549
Authors: Chunfang Shao, Pei-Xin Ye 
Publication date: 15 December 2021
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-018-1694-y
Recommendations
trigonometric systemquasi-greedy basisLebesgue constantsconvergence propertysumming basisChebyshev thresholding greedy algorithm
Trigonometric approximation (42A10) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A remark on greedy approximation in Banach spaces.
- Biorthogonal systems in Banach spaces
- Greedy algorithm for general biorthogonal systems
- Lebesgue-type inequalities for quasi-greedy bases
- On the existence of almost greedy bases in Banach spaces
- Greedy algorithm and \(m\)-term trigonometric approximation
- Nonlinear approximation by trigonometric sums
- Convergence of some greedy algorithms in Banach spaces
- Lebesgue constants for the weak greedy algorithm
- Efficiency of weak greedy algorithms for \(m\)-term approximations
- Lebesgue-type inequalities for greedy approximation with respect to quasi-greedy bases
- Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov
- Title not available (Why is that?)
- Weak thresholding greedy algorithms in Banach spaces
- Characterization of 1-almost greedy bases
- Characterization of 1-quasi-greedy bases
- Lebesgue inequalities for the greedy algorithm in general bases
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)
