Performance of the Thresholding Greedy Algorithm with Larger Greedy Sums

DOI10.1016/J.JMAA.2023.127126MaRDI QIDQ6397887arXivFDO

Authors Hùng Viẹt Chu

Publication date 30 April 2022

Published in arXiv

Full work available at URL https://doi.org/10.1016/J.JMAA.2023.127126

Mathematics Subject Classification ID

Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)

arXiv classification

math.FA

Abstract: 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 $lambdageqslant1$. We introduce the so-called $lambda$-almost greedy and $lambda$-partially greedy bases. The case when $lambda=1$ gives us the classical definitions of almost greedy and (strong) partially greedy bases. We show that a basis is almost greedy if and only if it is $lambda$-almost greedy for all (some) $lambdageqslant1$. However, for each $lambda>1$, there exists an unconditional basis that is $lambda$-partially greedy but is not $1$-partially greedy. Furthermore, we investigate and give examples when a basis is 1. not almost greedy with constant $1$ but is $lambda$-almost greedy with constant $1$ for some $lambda>1$, and 2. not strong partially greedy with constant $1$ but is $lambda$-partially greedy with constant $1$ for some $lambda>1$. Finally, we prove various characterizations of different greedy-type bases.

This page was built for publication: Performance of the Thresholding Greedy Algorithm with Larger Greedy Sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6397887)