Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
From MaRDI portal
Publication:2688668
DOI10.1007/s00041-023-09997-zOpenAlexW3206525446MaRDI QIDQ2688668
Silvia Lassalle, M. Berasategui
Publication date: 3 March 2023
Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.06849
Geometry and structure of normed linear spaces (46B20) 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)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Characterization of 1-almost greedy bases
- Characterization of 1-quasi-greedy bases
- On convergence of weak thresholding greedy algorithm in \(L^{1}\)(0,1)
- The best \(m\)-term approximation and greedy algorithms
- Greedy algorithm and \(m\)-term trigonometric approximation
- The thresholding greedy algorithm, greedy bases, and duality
- Lebesgue inequalities for the greedy algorithm in general bases
- Equivalence between almost-greedy and semi-greedy bases
- Weak thresholding greedy algorithms in Banach spaces
- Lebesgue inequalities for Chebyshev thresholding greedy algorithms
- Characterization of weight-semi-greedy bases
- Lebesgue constants for the weak greedy algorithm
- Topics in Banach Space Theory
- Characterizations of almost greedy and partially greedy bases
- On the existence of almost greedy bases in Banach spaces
- Greedy approximation for biorthogonal systems in quasi-Banach spaces
- Базисные последовательности, биортогональные системы и нормирующие множества в пространствах Банаха и Фреше
- Greedy algorithm for general biorthogonal systems
This page was built for publication: Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases
