Publication:
New parameters and Lebesgue-type estimates in greedy approximation

Date

2022

Authors

Ansorena, José L.
Berná, Pablo M.

Director

Publisher

Cambridge University Press
Acceso abierto / Sarbide irekia
Artículo / Artikulua
Versión publicada / Argitaratu den bertsioa

Project identifier

AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-107701GB-I00/ES/recolecta
AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PGC2018-095366-B-I00/ES/recolecta
AEI/Plan Estatal de Investigación Científica y Técnica y de Innovación 2017-2020/PID2019-105599GB-I00/ES/recolecta
Impacto
OpenAlexGoogle Scholar
cited by count

Abstract

The purpose of this paper is to quantify the size of the Lebesgue constants (𝑳𝑚)∞ 𝑚=1 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 (𝒌𝑚)∞ 𝑚=1 determines the growth of (𝑳𝑚)∞ 𝑚=1. Multiple theoretical applications and computational examples complement our study.

Description

Keywords

Lebesgue constants, Greedy approximation

Department

Estadística, Informática y Matemáticas / Estatistika, Informatika eta Matematika / Institute for Advanced Materials and Mathematics - INAMAT2

Faculty/School

Degree

Doctorate program

item.page.cita

Albiac, F., Ansorena, J. L., Berná, P. M. (2022) New parameters and Lebesgue-type estimates in greedy approximation. Forum of Mathematics, Sigma, 10, 1-39. https://doi.org/10.1017/fms.2022.102.

item.page.rights

© The Author(s), 2022. This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence.

Licencia

Los documentos de Academica-e están protegidos por derechos de autor con todos los derechos reservados, a no ser que se indique lo contrario.