The thresholding greedy algorithm versus approximations with sizes bounded by certain functions f

Let X be a Banach space and (en)n=1∞ be a basis. For a function f in a large collection F (closed under composition), we define and characterize f-greedy and f-almost greedy bases. We study relations among these bases as f varies and show that while a basis is not almost greedy, it can be f-greedy f...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of mathematical analysis and applications Jg. 539; H. 2; S. 128570
1. Verfasser: Chu, Hùng Việt
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier Inc 15.11.2024
Schlagworte:
Almost greedy
Bases
Thresholding greedy algorithm
Bases
Thresholding greedy algorithm
Almost greedy
ISSN:0022-247X, 1096-0813
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Let X be a Banach space and (en)n=1∞ be a basis. For a function f in a large collection F (closed under composition), we define and characterize f-greedy and f-almost greedy bases. We study relations among these bases as f varies and show that while a basis is not almost greedy, it can be f-greedy for some f∈F. Furthermore, we prove that for all non-identity function f∈F, we have the surprising equivalencef-greedy⟺f-almost greedy. We give various examples of Banach spaces to illustrate our results.
ISSN:0022-247X
1096-0813
DOI:10.1016/j.jmaa.2024.128570