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...
Saved in:
| Published in: | Annals of functional analysis Vol. 16; no. 3; p. 36 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Cham
Springer International Publishing
01.07.2025
Nature Publishing Group |
| Subjects: | |
| ISSN: | 2639-7390, 2008-8752, 2008-8752 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 against projections onto consecutive terms of the sequence and its shifts. We call the corresponding greedy-type condition the
F
(
a
n
)
-almost greedy property. Our first result shows that the
F
(
a
n
)
-almost greedy property is equivalent to the classical almost greedy property if and only if
(
a
n
)
n
=
1
∞
is bounded. Then we establish an analog of the result for the strong partially greedy property. Finally, we show that under a certain projection rule and conditions on the sequence
(
a
n
)
n
=
1
∞
,
we obtain a greedy-type condition that lies strictly between the almost greedy and strong partially greedy properties. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 2639-7390 2008-8752 2008-8752 |
| DOI: | 10.1007/s43034-025-00435-3 |