arXiv Analytics

Sign in

arXiv:2106.00975 [math.FA]AbstractReferencesReviewsResources

Weaker forms of unconditionality of bases in greedy approximation

Fernando Albiac, Jose L. Ansorena, Miguel Berasategui, Pablo M. Berna, Silvia Lassalle

Published 2021-06-02Version 1

In this paper we study a new class of bases, weaker than quasi-greedy bases, which retain their unconditionality properties and can provide the same optimality for the thresholding greedy algorithm. We measure how far these bases are from being unconditional and use this concept to give a new characterization of nearly unconditional bases.

Categories: math.FA
Subjects: 41A65, 41A46, 41A17, 46B15, 46B45
Related articles: Most relevant | Search more
arXiv:2104.10912 [math.FA] (Published 2021-04-22)
New parameters and Lebesgue-type estimates in greedy approximation
arXiv:1111.0460 [math.FA] (Published 2011-11-02, updated 2011-11-16)
Lebesgue-Type inequalities for quasi-greedy bases
arXiv:2209.09628 [math.FA] (Published 2022-09-20)
The Thresholding Greedy Algorithm versus Approximations with Sizes Bounded by Certain Functions $f$

Links

Toolbox