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

Celý popis

Podrobná bibliografia

Vydané v:	Journal of mathematical analysis and applications Ročník 525; číslo 1; s. 127126
Hlavný autor:	Chu, Hùng Việt
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.09.2023
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!