Mutual coherence (linear algebra)
A lower bound is 
This concept was introduced by David Donoho and Michael Elad.. A special case of this definition for the two-ortho case appeared earlier in the paper by Donoho and Huo,. The mutual coherence has since been used extensively in the field of sparse representations of signals. In particular, it is used as a measure of the ability of suboptimal algorithms such as matching pursuit and basis pursuit to correctly identify the true representation of a sparse signal.
- Tropp, J.A. (March 2006). "Just relax: Convex programming methods for identifying sparse signals in noise". IEEE Transactions on Information Theory. 52 (3): 1030–1051. doi:10.1109/TIT.2005.864420.
- Donoho, D.L.; M. Elad; V.N. Temlyakov (January 2006). "Stable recovery of sparse overcomplete representations in the presence of noise". IEEE Transactions on Information Theory. 52 (1): 6–18. doi:10.1109/TIT.2005.860430.
- Welch, L. R. (1974). "Lower bounds on the maximum cross-correlation of signals". IEEE Transactions on Information Theory. 20: 397–399. doi:10.1109/tit.1974.1055219.
- Zhiqiang, Xu (April 2011). "Deterministic Sampling of Sparse Trigonometric Polynomials". Journal of Complexity. 27 (2): 133–140. doi:10.1016/j.jco.2011.01.007.
- Donoho, D.L.; Michael Elad (March 2003). "Optimally sparse representation in general (nonorthogonal) dictionaries via L1 minimization". Proc. Nat. Aca. Sci. 100: 2197–2202. doi:10.1073/pnas.0437847100.
- Donoho, D.L.; Xiaoming Huo (November 2001). "Uncertainty principles and ideal atomic decomposition". IEEE Transactions on Information Theory. 47 (7): 2845–2862. doi:10.1109/18.959265.
- Fuchs, J.-J. (June 2004). "On sparse representations in arbitrary redundant bases". IEEE Transactions on Information Theory. 50 (6): 1341–1344. doi:10.1109/TIT.2004.828141.
|This linear algebra-related article is a stub. You can help Wikipedia by expanding it.|