On greedy algorithms with respect to generalized Walsh system
Functional Analysis
2011-09-20 v1
Abstract
In this paper we proof that there exists a function f(x) belongs to L^1[0,1] such that a greedy algorithm with regard to generalized Walsh system does not converge to f(x) in L^1[0,1] norm, i.e. the generalized Walsh system is not a quasi-greedy basis in its linear span L^1[0,1].
Keywords
Cite
@article{arxiv.1109.3806,
title = {On greedy algorithms with respect to generalized Walsh system},
author = {Sergo A. Episkoposian},
journal= {arXiv preprint arXiv:1109.3806},
year = {2011}
}