Approximation by polynomials with constant coefficients and the thresholding greedy algorithm

DOI10.37193/CJM.2025.01.03MaRDI QIDQ6963285zbMATH OpenFDO

Authors M. Berasategui, Pablo M. Berná, David S. González

Publication date 7 July 2025

Published in Carpathian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37193/CJM.2025.01.03

zbMATH Keywords

greedy basesunconditional 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)

Cites work

• A remark on greedy approximation in Banach spaces.
• Bidemocratic bases and their connections with other greedy-type bases
• Characterization of greedy bases in Banach spaces
• Characterizations of almost greedy and partially greedy bases
• Conditional quasi-greedy bases in non-superreflexive Banach spaces
• Elton's near unconditionality of bases as a threshold-free form of greediness
• Greedy algorithm for general biorthogonal systems
• Greedy algorithm with gaps
• Greedy approximation for biorthogonal systems in quasi-Banach spaces
• scientific article; zbMATH DE number 3129734 (Why is no real title available?)
• Locally bounded linear topological spaces
• On the existence of almost greedy bases in Banach spaces
• Quasi-greedy bases for sequences with gaps
• Renorming spaces with greedy bases
• The thresholding greedy algorithm, greedy bases, and duality
• The weighted property (A) and the greedy algorithm

This page was built for publication: Approximation by polynomials with constant coefficients and the thresholding greedy algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6963285)