Showing 2023Show all
2 papers · 1 filter
math.FA2023
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…
math.FA2023
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 …