Greedy-like bases for sequences with gaps
From MaRDI portal
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 cite{O2015}, T. Oikhberg introduced and studied variants of the greedy and weak greedy algorithms for sequences with gaps. In this paper, we continue the study of -quasi-greedy bases, and prove that for with bounded quotient gaps, -quasi-greedy bases are quasi-greedy generalizing the result proved in cite{BB} to the context of Markushevich bases. Additionally, we extend to this context and study several greedy-like properties.
Recommendations
Cites work
- A note on partially-greedy bases in quasi-Banach spaces
- A remark on greedy approximation in Banach spaces.
- Bidemocratic bases and their connections with other greedy-type bases
- Elton's near unconditionality of bases as a threshold-free form of greediness
- Equivalence between almost-greedy and semi-greedy bases
- Extensions of democracy-like properties for sequences with gaps
- Greedy algorithm for general biorthogonal systems
- Greedy algorithm with gaps
- Greedy approximation
- Greedy approximation for biorthogonal systems in quasi-Banach spaces
- scientific article; zbMATH DE number 3139051 (Why is no real title available?)
- scientific article; zbMATH DE number 1264507 (Why is no real title available?)
- scientific article; zbMATH DE number 2016952 (Why is no real title available?)
- scientific article; zbMATH DE number 5662770 (Why is no real title available?)
- Lebesgue constants for the weak greedy algorithm
- Lebesgue inequalities for the greedy algorithm in general bases
- Non-linear approximation of continuous functions by the Faber-Schauder system
- On approximate _1 systems in Banach spaces
- On the existence of almost greedy bases in Banach spaces
- Quasi-greedy bases and Lebesgue-type inequalities
- Quasi-greedy bases for sequences with gaps
- Strong partially greedy bases and Lebesgue-type inequalities
- The best m-term approximation and greedy algorithms
- The thresholding greedy algorithm, greedy bases, and duality
- The weighted property (A) and the greedy algorithm
- Topics in Banach Space Theory
- Weak forms of unconditionality of bases in greedy approximation
- Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
- Weak thresholding greedy algorithms in Banach spaces
This page was built for publication: Greedy-like bases for sequences with gaps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6124332)