On stability of Weak Greedy Algorithm in the presence of noise

This paper is devoted to the theoretical study of the efficiency, namely, stability of some greedy algorithms. In the greedy approximation theory researchers are mostly interested in the following two important properties of an algorithm – convergence and rate of convergence. In this paper we present some results on one more important property of an algorithm – stability. Stability means that small perturbations do not result in a large change in the outcome of the algorithm. In this paper we discuss one kind of perturbations – noisy data.