cr-sparse
Navigation
Contents:
Quick Start
Introduction
Tutorials
API Docs
Linear Operators
Sparse Linear Systems
Sparsifying Dictionaries and Sensing Matrices
Greedy Sparse Recovery
Convex Relaxation
Optimization
First Order Methods
Block Sparsity
Data Clustering
Sparse Subspace Clustering
Sample Data Generation Utilities
Test Problems
Miscellaneous Algorithms
Evaluation Framework
Algorithms
Theory
Examples Gallery
References
Development
Related Topics
Documentation overview
API Docs
Greedy Sparse Recovery
Previous:
cr.sparse.pursuit.sp.solve
Next:
cr.sparse.pursuit.sp.matrix_solve_jit
Quick search
cr.sparse.pursuit.sp.matrix_solve
¶
cr.sparse.pursuit.sp.
matrix_solve
(
Phi
,
y
,
K
,
max_iters
=
None
,
res_norm_rtol
=
0.0001
)
[source]
¶
Solves the sparse recovery problem
\(y = \Phi x + e\)
using Subspace Pursuit for matrices