The rate of convergence of weak greedy approximations over orthogonal dictionaries (Q2399411)

Let \(H\) be a Hilbert space and let \(D \subset H\) be a normalized dictionary, i.e., the linear span of \(D\) is dense in \(H\) and \(\|d\|=1\) for all \(d\in D\). A general result on the convergence of weak greedy approximations of \(x \in H\) was presented by \textit{V. N.~Temlyakov} [Adv. Comput. Math. 12, No. 2--3, 213--227 (2000; Zbl 0964.65009)]. In this paper, the author shows that for an orthogonal dictionary \(D\) the convergence rate of weak greedy approximations can be improved in asymptotically sharp form.