RUS  ENG
Full version
JOURNALS // Matematicheskii Sbornik // Archive

Mat. Sb., 2012 Volume 203, Number 3, Pages 49–78 (Mi sm7797)

This article is cited in 20 papers

Modifications of functions, Fourier coefficients and nonlinear approximation

M. G. Grigoryan

Yerevan State University

Abstract: This work continues the author's investigations of the convergence of greedy algorithms from the standpoint of classical results on correction of functions. In particular, the following result is obtained: for each $\varepsilon$, $0<\varepsilon<1$, there exists a measurable set $E\subset [0,1)$ of measure $|E|>1-\varepsilon$ such that for each function $f\in L^{1}[0,1)$ a function $\widetilde{f}\in L^{1}(0,1)$ equal to $f$ on $E$ can be found such that the greedy algorithm for $\widetilde{f}$ with respect to the Walsh system converges to it almost everywhere on $[0,1]$, and all the nonzero elements of the sequence of Walsh-Fourier coefficients of the function thus obtained are arranged in decreasing order of their absolute values.
Bibliography: 35 titles.

Keywords: Fourier coefficients, correction of functions, nonlinear approximation, greedy algorithm.

UDC: 517.518.454+517.518.36+517.518.8

MSC: 42C10

Received: 08.10.2010 and 20.04.2011

DOI: 10.4213/sm7797


 English version:
Sbornik: Mathematics, 2012, 203:3, 351–379

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025