Hostname: page-component-89b8bd64d-ktprf Total loading time: 0 Render date: 2026-05-08T05:47:58.829Z Has data issue: false hasContentIssue false

New parameters and Lebesgue-type estimates in greedy approximation

Published online by Cambridge University Press:  16 December 2022

Fernando Albiac
Affiliation:
Department of Mathematics, Statitistics, and Computer Sciences–InaMat2, Universidad Pública de Navarra, Campus de Arrosadía, 31006, Spain; E-mail: fernando.albiac@unavarra.es
José L. Ansorena
Affiliation:
Department of Mathematics and Computer Sciences, Universidad de La Rioja, Logroño, 26004, Spain; E-mail: joseluis.ansorena@unirioja.es
Pablo M. Berná
Affiliation:
Departamento de Métodos Cuantitativos, CUNEF Universidad, Madrid, 28040, Spain; E-mail: pablo.berna@cunef.edu

Abstract

The purpose of this paper is to quantify the size of the Lebesgue constants $(\boldsymbol {L}_m)_{m=1}^{\infty }$ associated with the thresholding greedy algorithm in terms of a new generation of parameters that modulate accurately some features of a general basis. This fine tuning of constants allows us to provide an answer to the question raised by Temlyakov in 2011 to find a natural sequence of greedy-type parameters for arbitrary bases in Banach (or quasi-Banach) spaces which combined linearly with the sequence of unconditionality parameters $(\boldsymbol {k}_m)_{m=1}^{\infty }$ determines the growth of $(\boldsymbol {L}_m)_{m=1}^{\infty }$. Multiple theoretical applications and computational examples complement our study.

Information

Type
Analysis
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2022. Published by Cambridge University Press