Lebesgue inequalities for the greedy algorithm in general bases

2016/06/21 by Berná, Pablo M., Garrigós, Gustavo, Blasco, Óscar · 2 citations
#FOS: Mathematics #Functional Analysis (math.FA)

paper · doi:10.48550/arxiv.1606.06721

Abstract

We present various estimates for the Lebesgue constants of the thresholding greedy algorithm, in the case of general bases in Banach spaces. We show the optimality of these estimates in some situations. Our results recover and slightly improve various estimates appearing earlier in the literature.

Cited by

• Enlarge Greedy Sums in Greedy-Type Properties by Different Factors
• Lebesgue-type estimates for greedy algorithms in quasi-Banach spaces

Related

• Lebesgue inequalities for Chebyshev Thresholding Greedy Algorithms
• Lebesgue-Type inequalities for quasi-greedy bases
• Lebesgue type inequalities for quasi-greedy bases
• New parameters and Lebesgue-type estimates in greedy approximation
• On some characterizations of greedy-type bases