Convergence of orthogonal greedy algorithm with errors in projectors (Q355338)

Iterative approximations of an element in a Hilbert space with elements in a subset called dictionary are discussed. The author proposes an orthogonal greedy algorithm and discusses computational errors and stability of the algorithm with respect to errors in projections onto the embedded subspaces. Convergence is established in terms of computational errors.