Characterization of 1-almost greedy bases

DOI10.1007/s13163-016-0204-3zbMath1368.46015arXiv1506.03397OpenAlexW2962846734MaRDI QIDQ506412

José Luis Ansorena, Fernando Albiac

Publication date: 31 January 2017

Published in: Revista Matemática Complutense (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.03397

zbMATH Keywords

unconditional basisquasi-greedy basisthresholding greedy algorithmproperty (A)almost greedy basis

Mathematics Subject Classification ID

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 (20)

Lebesgue constants for Chebyshev thresholding greedy algorithms ⋮ New parameters and Lebesgue-type estimates in greedy approximation ⋮ Lebesgue inequalities for the greedy algorithm in general bases ⋮ Asymptotic greediness of the Haar system in the spaces \(L_p[0,1\), \(1<p<\infty \)] ⋮ Elton's near unconditionality of bases as a threshold-free form of greediness ⋮ Counterexamples in isometric theory of symmetric and greedy bases ⋮ Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases ⋮ Extensions and new characterizations of some greedy-type bases ⋮ Lebesgue inequalities for Chebyshev thresholding greedy algorithms ⋮ Performance of the thresholding greedy algorithm with larger greedy sums ⋮ Building highly conditional almost greedy and quasi-greedy bases in Banach spaces ⋮ The best \(m\)-term approximation with respect to polynomials with constant coefficients ⋮ Conditional quasi-greedy bases in non-superreflexive Banach spaces ⋮ Weight-partially greedy bases and weight-property \((A)\) ⋮ Characterization of weight-semi-greedy bases ⋮ Strong partially greedy bases and Lebesgue-type inequalities ⋮ Greedy approximation for biorthogonal systems in quasi-Banach spaces ⋮ Smooth approximations without critical points of continuous mappings between Banach spaces, and diffeomorphic extractions of sets ⋮ The weighted property (A) and the greedy algorithm ⋮ Variations of property (A) constants and Lebesgue-type inequalities for the weak thresholding greedy algorithms

Cites Work

• Unnamed Item
• Renorming spaces with greedy bases
• Characterization of 1-greedy bases
• Characterization of 1-quasi-greedy bases
• The thresholding greedy algorithm, greedy bases, and duality
• Greedy algorithm for general biorthogonal systems

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