On sequential greedy-type bases On sequential greedy-type bases

It is known that a basis is almost greedy if and only if the thresholding greedy algorithm gives essentially the smallest error term compared to errors from projections onto intervals or in other words, consecutive terms of N . In this paper, we fix a sequence ( a n ) n = 1 ∞ and compare the TGA aga...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Annals of functional analysis Jg. 16; H. 3; S. 36
Hauptverfasser:	Berasategui, Miguel, Berná, Pablo M., Chu, Hùng Việt
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cham Springer International Publishing 01.07.2025 Nature Publishing Group
Schlagworte:	Approximation Functional Analysis Mathematics Mathematics and Statistics Original Paper 46B15 Thresholding greedy algorithm Consecutive almost greediness 46B25 Bases 41A65
ISSN:	2639-7390, 2008-8752, 2008-8752
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!