Joel Tropp
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.
Joel A. Tropp | |
---|---|
Born | July 1977 |
Nationality | |
Alma mater | University of Texas |
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) |
Scientific career | |
Fields | Applied mathematics |
Institutions | California Institute of Technology University of Michigan |
Doctoral advisor | Inderjit Dhillon Anna C. Gilbert |
Academic biography
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]
Research
In his early research,[4] Tropp developed performance guarantees for algorithms for sparse approximation and compressed sensing. In 2011, he published a paper[5] on 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,[6] collectively called matrix concentration inequalities, that includes the matrix Chernoff bound.
Awards and honors
Tropp was a recipient of the Presidential Early Career Award for Scientists and Engineers (PECASE) in 2008.[7] In 2010, he was awarded an Alfred P. Sloan Research Fellowship in Mathematics,[8] 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.[9] He was recognized as a Thomson Reuters Highly Cited Researcher in Computer Science for the years 2014, 2015, and 2016.[10] In 2019 he was named a SIAM Fellow "for contributions to signal processing, data analysis, and randomized linear algebra".[11]
References
- Joel A. Tropp, curriculum vitae. Retrieved August 5, 2014
- Joel A. Tropp at the Mathematics Genealogy Project
- Joel A. Tropp at the Caltech Directory
- Popov Prize, Previous Winners
- Halko, Nathan; Martinsson, Per-Gunnar; Tropp, Joel (2011), "Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions", SIAM Review, 53 (2): 217–288, arXiv:0909.4061, doi:10.1137/090771806
- Tropp, Joel (2012), "User-friendly tail bounds for sums of random matrices", Foundations of Computational Mathematics, 12 (4): 389–434, CiteSeerX 10.1.1.708.9756, doi:10.1007/s10208-011-9099-z
- "President Honors Outstanding Early-Career Scientists", press release from the National Science Foundation
- Sloan Foundation, Past Fellows
- "Joel A. Tropp receives the Monroe H. Martin Prize", news item from the California Institute of Technology
- Thomson Reuters Highly Cited Researchers
- SIAM Fellows Class of 2019, retrieved 2019-09-01