L1- convergence of greedy algorithm by generalized Walsh system
Abstract
In this paper we consider the generalized Walsh system and a problem L1- convergence of greedy algorithm of functions after changing the values on small set.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.