On the divergence of greedy algorithms with respect to Walsh subsystems in \(L\)

DOI10.1016/j.na.2006.02.023zbMath1118.46035arXiv1501.00832OpenAlexW2964270333MaRDI QIDQ875284

Sergo A. Episkoposian

Publication date: 13 April 2007

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Spaces of measurable functions ((L^p)-spaces, Orlicz spaces, Köthe function spaces, Lorentz spaces, rearrangement invariant spaces, ideal spaces, etc.) (46E30) Summability and bases; functional analytic aspects of frames in Banach and Hilbert spaces (46B15)

Related Items (4)

On the uniform convergence of the greedy algorithm in a generalized Walsh system ⋮ Convergence of greedy algorithm in Walsh system in \(L_p\) ⋮ Series with monotone coefficients in the Walsh system ⋮ \(L^p\)-convergence of greedy algorithm by generalized Walsh system

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The best \(m\)-term approximation and greedy algorithms
• Greedy algorithm and \(m\)-term trigonometric approximation
• Some remarks on greedy algorithms
• Greedy algorithm for general biorthogonal systems
• Adaptive greedy approximations

This page was built for publication: On the divergence of greedy algorithms with respect to Walsh subsystems in \(L\)