Banach Journal of Mathematical Analysis

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

Sergo A. Episkoposian

Full-text: Open access

Abstract

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

Article information

Source
Banach J. Math. Anal., Volume 6, Number 1 (2012), 161-174.

Dates
First available in Project Euclid: 14 May 2012

Permanent link to this document
https://projecteuclid.org/euclid.bjma/1337014675

Digital Object Identifier
doi:10.15352/bjma/1337014675

Mathematical Reviews number (MathSciNet)
MR2862553

Zentralblatt MATH identifier
1257.42037

Subjects
Primary: 42A65: Completeness of sets of functions
Secondary: 42A20: Convergence and absolute convergence of Fourier and trigonometric series

Keywords
generalized Walsh system monotonic coefficients greedy algorithm

Citation

Episkoposian, Sergo A. $L^1$-convergence of greedy algorithm by generalized Walsh system. Banach J. Math. Anal. 6 (2012), no. 1, 161--174. doi:10.15352/bjma/1337014675. https://projecteuclid.org/euclid.bjma/1337014675


Export citation