Joel Tropp
{{Short description|American mathematician (born 1977)}}
{{Infobox scientist
| boxwidth =
| name = Joel A. Tropp
| image = Tropp.jpg
| image_size = 200px
| alt =
| caption =
| birth_date = July {{birth year and age|1977}}
| birth_place = Austin, Texas
| residence =
| nationality = {{flagicon|US}} American
| fields = Applied mathematics
| workplaces = California Institute of Technology
University of Michigan
| alma_mater = University of Texas
| doctoral_advisor = Inderjit Dhillon
Anna C. Gilbert
| academic_advisors =
| doctoral_students =
| notable_students =
| 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.
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.[http://users.cms.caltech.edu/~jtropp/cv/tropp-short-cv-jun14.pdf Joel A. Tropp, curriculum vitae] {{Webarchive|url=https://web.archive.org/web/20140812205626/http://users.cms.caltech.edu/~jtropp/cv/tropp-short-cv-jun14.pdf |date=2014-08-12 }}. Retrieved August 5, 2014
His dissertation was titled Topics in Sparse Approximation, and his advisers were Inderjit Dhillon and Anna C. Gilbert.[http://www.genealogy.math.ndsu.nodak.edu/id.php?id=134163 Joel A. Tropp] at the Mathematics Genealogy Project
He taught at the University of Michigan from 2004 to 2007.
He has been on the faculty of the California Institute of Technology since 2007.[http://directory.caltech.edu/personnel/jtropp Joel A. Tropp] at the [http://directory.caltech.edu Caltech Directory]
Research
In his early research,{{Cite web |url=http://imi.cas.sc.edu/popov-prize-previous-winners/ |title=Popov Prize, Previous Winners |access-date=2014-08-11 |archive-date=2015-10-31 |archive-url=https://web.archive.org/web/20151031043701/http://imi.cas.sc.edu/popov-prize-previous-winners/ |url-status=dead }} Tropp developed performance guarantees for algorithms for sparse approximation and compressed sensing.
In 2011, he published a paper{{citation
| last1 = Halko | first1 = Nathan
| last2 = Martinsson | first2 = Per-Gunnar
| last3 = Tropp | first3 = Joel
| doi = 10.1137/090771806
| journal = SIAM Review
| title = Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
| volume = 53
| issue = 2
| pages = 217–288
| year = 2011| arxiv = 0909.4061| s2cid = 88251
}}
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,
{{citation
| last1 = Tropp | first1 = Joel
| doi = 10.1007/s10208-011-9099-z
| journal = Foundations of Computational Mathematics
| title = User-friendly tail bounds for sums of random matrices
| volume = 12
| issue = 4
| pages = 389–434
| year = 2012| citeseerx = 10.1.1.708.9756
| s2cid = 17735965
}}
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.[https://www.nsf.gov/news/news_summ.jsp?cntn_id=115171 "President Honors Outstanding Early-Career Scientists"], press release from the National Science Foundation
In 2010, he was awarded an Alfred P. Sloan Research Fellowship in Mathematics,{{Cite web |url=http://www.sloan.org/sloan-research-fellowships/past-fellows/ |title=Sloan Foundation, Past Fellows |access-date=2014-08-11 |archive-date=2016-11-06 |archive-url=https://web.archive.org/web/20161106043224/http://www.sloan.org/sloan-research-fellowships/past-fellows/ |url-status=dead }}
and he received the Sixth Vasil A. Popov Prize in approximation theory for his work on Matching Pursuit algorithms.
He won the Eighth Monroe H. Martin Prize in applied mathematics in 2011 for work on sparse optimization.[http://eas.caltech.edu/news/212 "Joel A. Tropp receives the Monroe H. Martin Prize"] {{Webarchive|url=https://web.archive.org/web/20220816080210/https://www.eas.caltech.edu/news/212 |date=2022-08-16 }}, news item from the California Institute of Technology
He was recognized as a Thomson Reuters Highly Cited Researcher in Computer Science for the years 2014, 2015, and 2016.[http://highlycited.com Thomson Reuters Highly Cited Researchers]
In 2019 he was named a SIAM Fellow "for contributions to signal processing, data analysis, and randomized linear algebra".{{citation|url=https://www.siam.org/Prizes-Recognition/Fellows-Program/All-SIAM-Fellows/Class-of-2019|title=SIAM Fellows Class of 2019|accessdate=2019-09-01}}
References
{{Reflist}}
External links
- [http://users.cms.caltech.edu/~jtropp/ Joel A. Tropp professional home page]
{{Authority control}}
{{DEFAULTSORT:Tropp, Joel Aaron}}
Category:University of Texas at Austin alumni
Category:California Institute of Technology faculty
Category:20th-century American mathematicians
Category:Sloan Research Fellows
Category:Fellows of the Society for Industrial and Applied Mathematics
Category:Mathematicians from Texas
Category:21st-century American mathematicians
Category:University of Michigan faculty
Category:Recipients of the Presidential Early Career Award for Scientists and Engineers