Characterization of 1-greedy bases

From MaRDI portal
Revision as of 11:06, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:818457

DOI10.1016/j.jat.2005.09.017zbMath1087.65048OpenAlexW2004005483MaRDI QIDQ818457

Fernando Albiac, Przemysław Wojtaszczyk

Publication date: 20 March 2006

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2005.09.017




Related Items (26)

Extensions of democracy-like properties for sequences with gapsNew parameters and Lebesgue-type estimates in greedy approximationLebesgue inequalities for the greedy algorithm in general basesWeak thresholding greedy algorithms in Banach spacesAsymptotic greediness of the Haar system in the spaces \(L_p[0,1\), \(1<p<\infty \)] ⋮ Characterization of 1-quasi-greedy basesOn weighted greedy-type basesThe functional-analytic properties of the limit \(q\)-Bernstein operatorElton's near unconditionality of bases as a threshold-free form of greedinessCounterexamples in isometric theory of symmetric and greedy basesPerformance of the thresholding greedy algorithm with larger greedy sumsRenorming spaces with greedy basesCharacterization of greedy bases in Banach spacesCharacterization of 1-almost greedy basesThe best \(m\)-term approximation with respect to polynomials with constant coefficients1-greedy renormings of Garling sequence spacesQuasi-greedy bases for sequences with gapsGreedy bases for Besov spacesRenormings and symmetry properties of 1-greedy basesWeight-partially greedy bases and weight-property \((A)\)A note on partially-greedy bases in quasi-Banach spacesStrong partially greedy bases and Lebesgue-type inequalitiesOn perfectly homogeneous bases in quasi-Banach spacesGreedy approximation for biorthogonal systems in quasi-Banach spacesThe weighted property (A) and the greedy algorithmVariations of property (A) constants and Lebesgue-type inequalities for the weak thresholding greedy algorithms



Cites Work


This page was built for publication: Characterization of 1-greedy bases