activity
20032022
most citedLittlewood-Paley decompositions and Besov spaces related to symmetric cones

5 citations · 7 across the 7 of their papers we have counts for

collaborators
Showing math.FAShow all

6 papers · 1 filter

math.FA2019

Lebesgue-type inequalities in greedy approximation

Stephen Dilworth, Gustavo Garrigos, Eugenio Hernandez +2

We present new results regarding Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA) in uniformly smooth Banach spaces. We improve earlier bounds in Temlyakov…

math.FA2018

Lebesgue inequalities for Chebyshev Thresholding Greedy Algorithms

Pablo M. Berná, Oscar Blasco, Gustavo Garrigós +2

We establish estimates for the Lebesgue parameters of the Chebyshev Weak Thresholding Greedy Algorithm in the case of general bases in Banach spaces. These generalize and slightly…

math.FA2017

Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces

P. M. Berná, O. Blasco, G. Garrigós +2

We obtain Lebesgue-type inequalities for the greedy algorithm for arbitrary complete seminormalized biorthogonal systems in Banach spaces. The bounds are given only in terms of the…

math.FA2016

Lebesgue inequalities for the greedy algorithm in general bases

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

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 estimat…

math.FA2013

Conditional quasi-greedy bases in Hilbert and Banach spaces

G. Garrigos, P. Wojtaszczyk

We show that, for quasi-greedy bases in Hilbert spaces, the associated conditionality constants grow at most as , for some , answering a question by Temlyakov…

math.FA2012

Lebesgue type inequalities for quasi-greedy bases

Gustavo Garrigós, Eugenio Hernández, Timur Oikhberg

We show that for quasi-greedy bases in real or complex Banach spaces the error of the thresholding greedy algorithm of order N is bounded by the best N- term error of approximation…