L¹- convergence of greedy algorithm by generalized Walsh system

2014/07/06 by Sergo A. Episkoposian, Episkoposian, Sergo A.
Mathematics · #42A20 #42A65 #Advanced Banach Space Theory #Advanced Harmonic Analysis Research #Approximation Theory and Sequence Spaces #FOS: Mathematics #Functional Analysis (math.FA) #math.FA #msc:42A20 #msc:42A65

paper · pdf · doi:10.48550/arxiv.1407.1496

arxiv created 2014/07/06 · openalex publication_date 2014/07/06 · arxiv updated 2014/07/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we consider the generalized Walsh system and a problem L¹- convergence of greedy algorithm of functions after changing the values on small set.

Related

• On greedy algorithms with respect to generalized Walsh system
• On the divergence of greedy algorithms with respect to Walsh subsystems in L
• Greedy algorithms: a review and open problems
• Lebesgue inequalities for the greedy algorithm in general bases
• On the rate of convergence of greedy algorithms