Uniform convergence of the greedy algorithm with respect to the Walsh system

Martin Grigoryan

Studia Mathematica (2010)

  • Volume: 198, Issue: 2, page 197-206
  • ISSN: 0039-3223

Abstract

top
For any 0 < ϵ < 1, p ≥ 1 and each function f L p [ 0 , 1 ] one can find a function g L [ 0 , 1 ) with mesx ∈ [0,1): g ≠ f < ϵ such that its greedy algorithm with respect to the Walsh system converges uniformly on [0,1) and the sequence | c k ( g ) | : k s p e c ( g ) is decreasing, where c k ( g ) is the sequence of Fourier coefficients of g with respect to the Walsh system.

How to cite

top

Martin Grigoryan. "Uniform convergence of the greedy algorithm with respect to the Walsh system." Studia Mathematica 198.2 (2010): 197-206. <http://eudml.org/doc/285632>.

@article{MartinGrigoryan2010,
abstract = {For any 0 < ϵ < 1, p ≥ 1 and each function $f ∈ L^\{p\}[0,1]$ one can find a function $g ∈ L^\{∞\}[0,1)$ with mesx ∈ [0,1): g ≠ f < ϵ such that its greedy algorithm with respect to the Walsh system converges uniformly on [0,1) and the sequence $\{|c_\{k\}(g)|: k ∈ spec(g)\}$ is decreasing, where $\{c_\{k\}(g)\}$ is the sequence of Fourier coefficients of g with respect to the Walsh system.},
author = {Martin Grigoryan},
journal = {Studia Mathematica},
keywords = {greedy algorithm; Walsh system},
language = {eng},
number = {2},
pages = {197-206},
title = {Uniform convergence of the greedy algorithm with respect to the Walsh system},
url = {http://eudml.org/doc/285632},
volume = {198},
year = {2010},
}

TY - JOUR
AU - Martin Grigoryan
TI - Uniform convergence of the greedy algorithm with respect to the Walsh system
JO - Studia Mathematica
PY - 2010
VL - 198
IS - 2
SP - 197
EP - 206
AB - For any 0 < ϵ < 1, p ≥ 1 and each function $f ∈ L^{p}[0,1]$ one can find a function $g ∈ L^{∞}[0,1)$ with mesx ∈ [0,1): g ≠ f < ϵ such that its greedy algorithm with respect to the Walsh system converges uniformly on [0,1) and the sequence ${|c_{k}(g)|: k ∈ spec(g)}$ is decreasing, where ${c_{k}(g)}$ is the sequence of Fourier coefficients of g with respect to the Walsh system.
LA - eng
KW - greedy algorithm; Walsh system
UR - http://eudml.org/doc/285632
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.