Performance of the Thresholding Greedy Algorithm with larger greedy sums

The goal of this paper is to study the performance of the Thresholding Greedy Algorithm (TGA) when we increase the size of greedy sums by a constant factor λ⩾1. We introduce the so-called λ-almost greedy and λ-partially greedy bases. The case when λ=1 gives us the classical definitions of almost gre...

Full description

Bibliographic Details

Published in:	Journal of mathematical analysis and applications Vol. 525; no. 1; p. 127126
Main Author:	Chu, Hùng Việt
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.09.2023
Subjects:	Almost greedy Characterizations Greedy Partially greedy Reverse partially greedy bases Reverse partially greedy bases Characterizations Partially greedy Greedy Almost greedy
ISSN:	0022-247X, 1096-0813
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!