Characterization of greedy bases in Banach spaces
From MaRDI portal
(Redirected from Publication:505893)
Abstract: We shall present a new characterization of greedy bases and 1-greedy bases in terms of certain functionals defined using distances to one dimensional subspaces generated by the basis. We also introduce a new property that unifies the notions of unconditionality and democracy and allows us to recover a better dependence on the constants.
Recommendations
Cites work
Cited in
(17)- A remark on approximation with polynomials and greedy bases
- The best m-term approximation with respect to polynomials with constant coefficients
- The weighted property (A) and the greedy algorithm
- On left democracy function
- Lebesgue inequalities for Chebyshev thresholding greedy algorithms
- Weak forms of unconditionality of bases in greedy approximation
- Renorming spaces with greedy bases
- On consecutive greedy and other greedy-like type of bases
- A note on partially-greedy bases in quasi-Banach spaces
- On some characterizations of greedy-type bases
- Characterization of 1-greedy bases
- Elton's near unconditionality of bases as a threshold-free form of greediness
- Characterization of 1-almost greedy bases
- Extensions and new characterizations of some greedy-type bases
- Characterizations of almost greedy and partially greedy bases
- Characterization of 1-quasi-greedy bases
- Greedy algorithms for reduced bases in Banach spaces
This page was built for publication: Characterization of greedy bases in Banach spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q505893)