| Joel A. Tropp | |
| Birth Date: | July |
| Birth Place: | Austin, Texas |
| Nationality: |  American |
| Fields: | Applied mathematics |
| Workplaces: | California Institute of Technology University of Michigan |
| Alma Mater: | University of Texas |
| Doctoral Advisor: | Inderjit Dhillon Anna C. Gilbert |
| Known For: | Matching pursuit, Randomized SVD, Matrix Chernoff bound |
| Awards: | Presidential Early Career Award for Scientists and Engineers (2008) Alfred P. Sloan Research Fellowship (2010) Vasil A. Popov Prize (2010) Monroe H. Martin Prize (2011) |
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.
Tropp studied at the University of Texas, where he completed the BS degree in Mathematics and the BA degree in Plan II Honors in 1999 and the MS and PhD degrees in Computational & Applied Mathematics in 2001 and 2004.[1] His dissertation was titled Topics in Sparse Approximation, and his advisers were Inderjit Dhillon and Anna C. Gilbert.[2] He taught at the University of Michigan from 2004 to 2007.[1] He has been on the faculty of the California Institute of Technology since 2007.[3]
In his early research,[4] Tropp developed performance guarantees for algorithms for sparse approximation and compressed sensing.In 2011, he published a paperon randomized algorithms for computing a truncated singular value decomposition.He has also worked in random matrix theory, where he has established a family of results,collectively called matrix concentration inequalities, that includes the matrix Chernoff bound.
Tropp was a recipient of the Presidential Early Career Award for Scientists and Engineers (PECASE) in 2008.[5] In 2010, he was awarded an Alfred P. Sloan Research Fellowship in Mathematics,[6] and he received the Sixth Vasil A. Popov Prize in approximation theory for his work on Matching Pursuit algorithms.[4] He won the Eighth Monroe H. Martin Prize in applied mathematics in 2011 for work on sparse optimization.[7] He was recognized as a Thomson Reuters Highly Cited Researcher in Computer Science for the years 2014, 2015, and 2016.[8] In 2019 he was named a SIAM Fellow "for contributions to signal processing, data analysis, and randomized linear algebra".