Lebesgue constants for Chebyshev thresholding greedy algorithms

DOI10.1186/s13660-018-1694-yzbMath1497.41015OpenAlexW2802480597MaRDI QIDQ824549

Chun Fang 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

zbMATH Keywords

Lebesgue constantstrigonometric systemquasi-greedy basisconvergence propertysumming basisChebyshev thresholding greedy algorithm

Mathematics Subject Classification ID

Trigonometric approximation (42A10) Rate of convergence, degree of approximation (41A25) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Related Items (1)

Lebesgue inequalities for Chebyshev thresholding greedy algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficiency of weak greedy algorithms for \(m\)-term approximations
• Lebesgue-type inequalities for quasi-greedy bases
• Characterization of 1-almost greedy bases
• Characterization of 1-quasi-greedy bases
• Greedy algorithm and \(m\)-term trigonometric approximation
• Nonlinear approximation by trigonometric sums
• Lebesgue inequalities for the greedy algorithm in general bases
• Convergence of some greedy algorithms in Banach spaces
• Weak thresholding greedy algorithms 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
• Lebesgue constants for the weak greedy algorithm
• On the existence of almost greedy bases in Banach spaces
• Biorthogonal systems in Banach spaces
• Greedy algorithm for general biorthogonal systems

This page was built for publication: Lebesgue constants for Chebyshev thresholding greedy algorithms