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...

Celý popis

Podrobná bibliografia

Vydané v:	Annals of functional analysis Ročník 16; číslo 3; s. 36
Hlavní autori:	Berasategui, Miguel, Berná, Pablo M., Chu, Hùng Việt
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cham Springer International Publishing 01.07.2025 Nature Publishing Group
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!