On greedy algorithms with respect to generalized Walsh system
Abstract
In this paper we proof that there exists a function f(x) belongs to L1[0,1] such that a greedy algorithm with regard to generalized Walsh system does not converge to f(x) in L1[0,1] norm, i.e. the generalized Walsh system is not a quasi-greedy basis in its linear span L1[0,1].
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.