Convergence of orthogonal greedy algorithm with errors in projectors

A model of orthogonal greedy algorithm is proposed. This model allows one to consider computational errors and to study the stability of this algorithm with respect to errors in projections onto subspaces. A criterion for the convergence of orthogonal greedy expansion to the expanded element is given in terms of computational errors.