Fast Orthogonal Matching Pursuit Algorithm for Exact Recovery and Sparse Approximation

This paper proposes two fundamental improvements to the classical Orthogonal Matching Pursuit (OMP) algorithm to make it computationally more efficient while preserving its excellent performance guarantees. The proposed algorithms, OMP-SR and BSR, achieve significant speedup over OMP by avoiding the expensive computation of pseudo-inverse over an increasing-sized matrix.