Joel A. Tropp

Joel A. Tropp is a person.

• See: Random Matrix Theory, Randomized Matrix Decomposition, Matching Pursuit, Matrix Chernoff Bound.

---

---

References

• https://scholar.google.com/citations?user=i4_3daEAAAAJ

2019

• (Wikipedia, 2019) ⇒ https://en.wikipedia.org/wiki/Joel_Tropp Retrieved:2019-10-14.
  • Joel Aaron Tropp (born July 1977 in Austin, Texas) is the Steele Family Professor of Applied and Computational Mathematics in the Computing and Mathematical Sciences Department at the California Institute of Technology. He is known for work on sparse approximation, numerical linear algebra, and random matrix theory.

2011

• (Halko et al., 2011) ⇒ Nathan Halko, Per-Gunnar Martinsson, and Joel A. Tropp. (2011). “Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions.” In: SIAM Review Journal, 53(2). doi:10.1137/090771806

2007

• (Tropp & Gilbert, 2007) ⇒ Joel A. Tropp, and Anna C. Gilbert. (2007). “Signal Recovery from Random Measurements via Orthogonal Matching Pursuit.” IEEE Transactions on information theory 53, no. 12

---