Characterization of weight-semi-greedy bases

DOI10.1007/s00041-020-09727-9zbMath1444.46013arXiv1902.10986OpenAlexW3004371481MaRDI QIDQ2291574

Pablo M. Berná

Publication date: 31 January 2020

Published in: The Journal of Fourier Analysis and Applications (Search for Journal in Brave)

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

zbMATH Keywords

thresholding greedy algorithmsemi-greedy basesweight-almost-greedy bases

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

On weighted greedy-type bases ⋮ Weak greedy algorithms and the equivalence between semi-greedy and almost greedy Markushevich bases ⋮ Bidemocratic bases and their connections with other greedy-type bases

Cites Work

• Unnamed Item
• Unnamed Item
• Characterization of 1-almost greedy bases
• The thresholding greedy algorithm, greedy bases, and duality
• Embeddings and Lebesgue-type inequalities for the greedy algorithm in Banach spaces
• Lebesgue inequalities for the greedy algorithm in general bases
• Greedy algorithm with gaps
• Equivalence between almost-greedy and semi-greedy bases
• Convergence of some greedy algorithms in Banach spaces
• Restricted nonlinear approximation
• The weighted property (A) and the greedy algorithm
• Sparse approximation with bases. Based on advanced courses given at the Centre de Recerca Matemàtica, Barcelona, Spain, November 2011. Edited by Sergey Tikhonov
• Lebesgue constants for the weak greedy algorithm
• Greedy Approximation
• On the existence of almost greedy bases in Banach spaces
• Greedy algorithm for general biorthogonal systems

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