Divergence of the greedy algorithm in the Faber-Schauder system on a continuum cardinality set

DOI10.3103/S1068362307020070zbMath1231.42027OpenAlexW2012522045MaRDI QIDQ944118

Artsrun Sargsyan

Publication date: 12 September 2008

Published in: Journal of Contemporary Mathematical Analysis. Armenian Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1068362307020070

zbMATH Keywords

convergenceapproximationgreedy algorithmFourier series

Mathematics Subject Classification ID

Fourier series in special orthogonal functions (Legendre polynomials, Walsh functions, etc.) (42C10) Approximation by other special function classes (41A30)

Cites Work

• Unnamed Item
• Unnamed Item
• On nonlinear approximation with respect to the Haar system and modifications of functions
• Greedy algorithm and \(m\)-term trigonometric approximation
• Decreasing rearranged Fourier series
• Nonlinear methods of approximation
• Some remarks on greedy algorithms
• Greedy approximation with respect to certain subsystems of the Walsh orthonormal system
• On the existence of almost greedy bases in Banach spaces
• Greedy algorithm for general biorthogonal systems

This page was built for publication: Divergence of the greedy algorithm in the Faber-Schauder system on a continuum cardinality set