The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Currently displaying 1 – 1 of 1

Showing per page

Order by Relevance | Title | Year of publication

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

Martin Grigoryan — 2010

Studia Mathematica

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.

Page 1

Download Results (CSV)