- Routines to directly calculate a source element for a given matrix and a vector , that is, calculate a vector such that
The existence of such a vector ensures that the minimization problem (the Basis Pursuit problem)
has the unique solution (is other words: is recovered exactly). This is particularly helpful is you are interested in unique solutions for Basis pursuit without posing strong conditions which even imply –-equivalence.
- Routines related to RIP constants, the ERC coefficient of Joel Tropp and the mutual coherence.
- An implementation of the heuristic support evaluation HSE (also described in my previous post). (By the way: We were tempted to call this device “support evaluation routine” with acronym SuppER but abandoned this idea.)