4 citations · 7 across the 22 of their papers we have counts for
4 papers · 1 filter
On sequential greedy-type bases
Miguel Berasategui, Pablo M. Berná, Hung Viet Chu
It is known that a basis is almost greedy if and only if the thresholding greedy algorithm gives essentially the smallest error term compared to errors from projections onto interv…
Approximation by polynomials with constant coefficients and the Thresholding Greedy Algorithm
Miguel Berasategui, Pablo M. Berná, David González
Greedy bases are those bases where the Thresholding Greedy Algorithm (introduced by S. V. Konyagin and V. N. Temlyakov) produces the best possible approximation up to a constant. I…
Linear versus nonlinear forms of partial unconditionality of bases
Fernando Albiac, Jose L. Ansorena, Miguel Berasategui
The main results in this paper contribute to bring to the fore novel underlying connections between the contemporary concepts and methods springing from greedy approximation theory…
On consecutive greedy and other greedy-like type of bases
Miguel Berasategui, Pablo M. Berná, Hung Viet Chu
We continue our study of the Thresholding Greedy Algorithm when we restrict the vectors involved in our approximations so that they either are supported on intervals of …