Paper detail

The Weak Chebyshev Greedy Algorithm (WCGA) in $L^p (\log L)^α$ spaces

We present some new results concerning Lebesgue-type inequalities for the Weak Chebyshev Greedy Algorithm (WCGA) in uniformly smooth Banach spaces $\mathbb{X}$. First, we generalize a result of Temlyakov to cover situations in which the modulus of smoothness and the so called A3 parameter are not necessarily power functions. Secondly, we apply this new theorem to the Zygmund spaces $\mathbb{X}=L^p(\log L)^α$, with $1<p<\infty$ and $α\in\mathbb{R}$, and show that, when the Haar system is used, then optimal recovery of $N$-sparse signals occurs when the number of iterations is $ϕ(N)=O(N^{\max\{1,2/p&#39;\}} \,(\log N)^{|α| p&#39;})$. Moreover, this quantity is sharp when $p\leq 2$. Finally, an expression for $ϕ(N)$ in the case of the trigonometric system is also given, which in the special case of $L^2(\log L)^α$, with $α>0$, takes the form $ϕ(N)\approx \log(\log N)$.