Lebesgue inequalities for the greedy algorithm in general bases

By Pablo M. Berná, Ó. Blasco, Gustavo Garrigós. 2016

50 citations recorded by the source corpus.

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

Subfields: Applied Mathematics, Mathematical Physics, Numerical Analysis

View Paper: https://www.semanticscholar.org/paper/6e5e1569f370c14af93fb04f796aa5ffcb60ddec

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

1. Pablo M. Berná
2. Fernando Albiac
3. José L. Ansorena
4. Przemyslaw Wojtaszczyk
5. Vladimir N. Temlyakov
6. Gustavo Garrigós
7. Morten Nielsen
8. Rémi Gribonval

In Mathematical Physics

1. Pablo M. Berná
2. José L. Ansorena
3. Fernando Albiac
4. Przemyslaw Wojtaszczyk
5. Vladimir N. Temlyakov
6. Gustavo Garrigós
7. Rémi Gribonval
8. Morten Nielsen

In Numerical Analysis

1. Przemyslaw Wojtaszczyk
2. José L. Ansorena
3. Pablo M. Berná
4. Fernando Albiac

Citations in the corpus

• Greedy approximation for biorthogonal systems in quasi-Banach spaces (2019, methodology): “In the context of greedy-like bases the truncation operator was introduced in [32] and studied in depth in [21].”