L^1-convergence of greedy algorithm by generalized Walsh system

From MaRDI portal
(Redirected from Publication:437717)
\(L^1\)-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.


The paper considers the \(L^1\)-convergence of the greedy algorithm with respect to the generalized Walsh system after changing the values of a function on a small set. The main results extend results by \textit{M. G. Grigoryan} [Anal. Math. 17, No. 3, 211--237 (1991; Zbl 0754.42006); Russ. Math. 52, No. 5, 20--31 (2008); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 2008, No. 5, 26--37 (2008; Zbl 1160.42313)] related to the classical trigonometric and Walsh systems.











This page was built for publication: \(L^1\)-convergence of greedy algorithm by generalized Walsh system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q437717)