Generalized Approximate Weak Greedy Algorithms

We study generalized approximate weak greedy algorithms. The main difference of these algorithms from approximate weak greedy algorithms proposed by R. Gribonval and M. Nielsen consists in that errors in the calculation of the coefficients can be prescribed in terms of not only their relative values, but also their absolute values. We present conditions on the parameters of generalized approximate weak greedy algorithms which are sufficient for the expansions resulting from the use of this algorithm to converge to the expanded element. It is shown that these conditions cannot be essentially weakened. We also study some questions of the convergence of generalized approximate weak greedy expansions with respect to orthonormal systems.__________Translated from Matematicheskie Zametki, vol. 78, no. 2, 2005, pp. 186–201.Original Russian Text Copyright © 2005 by V. V. Galatenko, E. D. Livshits.