Artículo

Strong Partially Greedy Bases and Lebesgue-Type Inequalities

Berasategui, Miguel HernánIcon ; Berna Larrosa, Pablo Manuel; Lassalle, Silvia BeatrizIcon
Fecha de publicación: 12/2021
Editorial: Springer
Revista: Constructive Approximation
ISSN: 0176-4276
Idioma: Inglés
Tipo de recurso: Artículo publicado
Clasificación temática:

Resumen

In this paper we continue the study of Lebsgue-type inequalities for greedy algorithms. We introduce the notion of strong partially greedy Markushevich bases and study the Lebesgue-type parameters associated with them. We prove that this property is equivalent to that of being conservative and quasi-greedy, extending a similar result given in the paper by Dilworth, Kalton, Kutzarova and temlyakov (2003) for Schauder bases. We also give a characterization of 1-strong partial greediness, following the study started by Albianc ans Wojtaszczyk (2006) and continued by Albiac and Ansorena (2017).
Palabras clave: GREEDY ALGORITHM , LEBESGUE-TYPE INEQUALITY , NONLINEAR APPROXIMATION , PARTIALLY GREEDY BASES , QUASI-GREEDY BASES
 
Archivos asociados
Tamaño: 458.9Kb
Formato: PDF
.
Licencia
info:eu-repo/semantics/restrictedAccess Excepto donde se diga explícitamente, este item se publica bajo la siguiente descripción: Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Unported (CC BY-NC-SA 2.5)
Identificadores
URI: http://hdl.handle.net/11336/166503
DOI: https://doi.org/10.1007/s00365-021-09531-8
URL: https://link.springer.com/article/10.1007/s00365-021-09531-8
Colecciones
Articulos(IMAS)
Articulos de INSTITUTO DE INVESTIGACIONES MATEMATICAS "LUIS A. SANTALO"
Citación
Berasategui, Miguel Hernán; Berna Larrosa, Pablo Manuel; Lassalle, Silvia Beatriz; Strong Partially Greedy Bases and Lebesgue-Type Inequalities; Springer; Constructive Approximation; 54; 3; 12-2021; 507-528
Compartir
Altmétricas