On the recursive greedy algorithm

We study the recursive greedy algorithm (RCA) and prove its convergence for any initial function and,any dictionary. We get exact (in the power scale) estimates for the rate of convergence of the RGA in the case when the initial function belongs to the class A(1)(D). These estimates are extended to larger classes of initial functions and are used to compare some classes of functions determined by a given dictionary.