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.
引用格式
Thanasis (2026). Sparse Approximate Solutions to Linear Systems (https://ww2.mathworks.cn/matlabcentral/fileexchange/29101-sparse-approximate-solutions-to-linear-systems), MATLAB Central File Exchange. 检索时间: .
| 版本 | 已发布 | 发行说明 | Action |
|---|---|---|---|
| 1.0.0.0 |
