Finding the sparsest solution to underdetermined systems of linear equations y = Φ x is NP-hard in general. We show here that for systems with “typical”/“random” Φ, a good approximation to the sparsest solution is obtained by applying a fixed number of standard operations from linear algebra. Our pr...
No comments yet
Be the first to share your thoughts!