Weaker forms of unconditionality of bases in greedy approximation
From MaRDI portal
Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46) 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) Banach sequence spaces (46B45)
Abstract: 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.
This page was built for publication: Weaker forms of unconditionality of bases in greedy approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6369204)
