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

Full description

Bibliographic Details

Published in:	Annals of functional analysis Vol. 16; no. 3; p. 36
Main Authors:	Berasategui, Miguel, Berná, Pablo M., Chu, Hùng Việt
Format:	Journal Article
Language:	English
Published:	Cham Springer International Publishing 01.07.2025 Nature Publishing Group
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!