2019
DOI: 10.1016/j.jat.2019.105300
|View full text |Cite
|
Sign up to set email alerts
|

The weighted property (A) and the greedy algorithm

Abstract: We investigate various aspects of the "weighted" greedy algorithm with respect to a Schauder basis. For a weight w, we describe w-greedy, w-almost-greedy, and w-partiallygreedy bases, and examine some properties of w-semi-greedy bases. To achieve these goals, we introduce and study the w-Property (A).2000 Mathematics Subject Classification. 46B15, 41A65.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
32
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 20 publications
(32 citation statements)
references
References 17 publications
(39 reference statements)
0
32
0
Order By: Relevance
“…Thus from Theorem 2.1 it follows that if a basis (e n ) is quasi-greedy and has w-left Property (A) then (e n ) is w-partially greedy. We now prove this result using the arguments similar to [2] to get better estimates in terms of the constant. Proof.…”
Section: Weight-left Property (A) and Weight-right Property (A)mentioning
confidence: 73%
See 4 more Smart Citations
“…Thus from Theorem 2.1 it follows that if a basis (e n ) is quasi-greedy and has w-left Property (A) then (e n ) is w-partially greedy. We now prove this result using the arguments similar to [2] to get better estimates in terms of the constant. Proof.…”
Section: Weight-left Property (A) and Weight-right Property (A)mentioning
confidence: 73%
“…It was proved in [2] that a basis is w-partially greedy if and only if it is quasi-greedy and wconservative. Thus from Theorem 2.1 it follows that the w-partially greedy basis considered in this paper is equivalent to the one considered in [2].…”
Section: Introductionmentioning
confidence: 77%
See 3 more Smart Citations