Characterizations of almost greedy and partially greedy bases
From MaRDI portal
Publication:3295517
zbMath1457.46016arXiv1805.06778MaRDI QIDQ3295517
Divya Khurana, Stephen Dilworth
Publication date: 10 July 2020
Full work available at URL: https://arxiv.org/abs/1805.06778
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 (5)
Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases ⋮ Extensions and new characterizations of some greedy-type bases ⋮ Performance of the thresholding greedy algorithm with larger greedy sums ⋮ Weight-partially greedy bases and weight-property \((A)\) ⋮ A remark on approximation with polynomials and greedy bases
This page was built for publication: Characterizations of almost greedy and partially greedy bases