Sparse Approximate Solutions to Linear Systems

The code implements the algorithm presented by B.K.Natarajan in SIAM. April '95.

The following problem is considered: given a matrix A in R(mxn), a vector b in R(m) and e>0, compute a vector x satisfying norm(Ax-b)<=e if such exists, such that x has the fewest number of non-zero entries over all such vectors.