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

Full description

Bibliographic Details

Published in:	Journal of mathematical analysis and applications Vol. 539; no. 2; p. 128570
Main Author:	Chu, Hùng Việt
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 15.11.2024
Subjects:	Almost greedy Bases Thresholding greedy algorithm Bases Thresholding greedy algorithm Almost greedy
ISSN:	0022-247X, 1096-0813
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!