Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
