| Title: |
Approximation by polynomials with constant coefficients and the Thresholding Greedy Algorithm. |
| Authors: |
BERASATEGUI, MIGUEL1 mberasategui@dm.uba.ar, BERNÁ, PABLO M.2 pablo.berna@cunef.edu, GONZÁLEZ, DAVID3 david.gonzalezmoro@usp.ceu.es |
| Source: |
Carpathian Journal of Mathematics. 2025, Vol. 41 Issue 1, p31-44. 14p. |
| Subject Terms: |
*GREEDY algorithms, *POLYNOMIAL approximation, *POLYNOMIALS |
| Abstract: |
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. In 2017, P. M. Berná and Ó. Blasco gave a characterization of these bases using polynomials with constant coefficients. In this paper, we continue this study improving some optimization problems and extending some results to the context of quasi-Banach spaces. [ABSTRACT FROM AUTHOR] |
|
Copyright of Carpathian Journal of Mathematics is the property of Carpathian Journal of Mathematics and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Academic Search Complete |
