Scribd
Upload
16 views

Joel_Tropp

Uploaded by

marie.angelina.scultz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
16 views

Joel_Tropp

Uploaded by

marie.angelina.scultz
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Joel Tropp

Joel Aaron Tropp (born July 1977 in Austin, Texas) is


the Steele Family Professor of Applied and Joel A. Tropp
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 Born July 1977 (age 46–47)
2001 and 2004.[1] His dissertation was titled Topics in Austin, Texas
Sparse Approximation, and his advisers were Inderjit Nationality American
Dhillon and Anna C. Gilbert.[2] He taught at the Alma mater University of Texas
University of Michigan from 2004 to 2007.[1] He has
Known for Matching pursuit, Randomized
been on the faculty of the California Institute of
SVD, Matrix Chernoff bound
Technology since 2007.[3]
Awards Presidential Early Career Award
for Scientists and Engineers

Research (2008)
Alfred P. Sloan Research
In his earlyresearch,[4]Tropp developed performance Fellowship (2010)
guarantees for algorithms for sparse approximation and Vasil A. Popov Prize (2010)
compressed sensing. In 2011, he published a paper[5]
on randomized algorithms for computing a truncated Monroe H. Martin Prize (2011)
singular value decomposition. He has also worked in Scientific career
random matrix theory, where he has established a Fields Applied mathematics
family of results,[6] collectively called matrix Institutions California Institute of Technology
concentration inequalities, that includes the matrix
University of Michigan
Chernoff bound.
Doctoral Inderjit Dhillon
advisor Anna C. Gilbert

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
1. Joel A. Tropp, curriculum vitae (http://users.cms.caltech.edu/~jtropp/cv/tropp-short-cv-jun14.
pdf) Archived (https://web.archive.org/web/20140812205626/http://users.cms.caltech.edu/~jt
ropp/cv/tropp-short-cv-jun14.pdf) 2014-08-12 at the Wayback Machine. Retrieved August 5,
2014
2. Joel A. Tropp (http://www.genealogy.math.ndsu.nodak.edu/id.php?id=134163) at the
Mathematics Genealogy Project
3. Joel A. Tropp (http://directory.caltech.edu/personnel/jtropp) at the Caltech Directory (http://dir
ectory.caltech.edu)
4. "Popov Prize, Previous Winners" (https://web.archive.org/web/20151031043701/http://imi.ca
s.sc.edu/popov-prize-previous-winners/). Archived from the original (http://imi.cas.sc.edu/po
pov-prize-previous-winners/) on 2015-10-31. Retrieved 2014-08-11.
5. 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 (https://arxiv.org/abs/0909.4061),
doi:10.1137/090771806 (https://doi.org/10.1137%2F090771806), S2CID 88251 (https://api.s
emanticscholar.org/CorpusID:88251)
6. 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 (https://citeseerx.i
st.psu.edu/viewdoc/summary?doi=10.1.1.708.9756), doi:10.1007/s10208-011-9099-z (http
s://doi.org/10.1007%2Fs10208-011-9099-z), S2CID 17735965 (https://api.semanticscholar.o
rg/CorpusID:17735965)
7. "President Honors Outstanding Early-Career Scientists" (https://www.nsf.gov/news/news_su
mm.jsp?cntn_id=115171), press release from the National Science Foundation
8. "Sloan Foundation, Past Fellows" (https://web.archive.org/web/20161106043224/http://www.
sloan.org/sloan-research-fellowships/past-fellows/). Archived from the original (http://www.sl
oan.org/sloan-research-fellowships/past-fellows/) on 2016-11-06. Retrieved 2014-08-11.
9. "Joel A. Tropp receives the Monroe H. Martin Prize" (http://eas.caltech.edu/news/212)
Archived (https://web.archive.org/web/20220816080210/https://www.eas.caltech.edu/news/
212) 2022-08-16 at the Wayback Machine, news item from the California Institute of
Technology
10. Thomson Reuters Highly Cited Researchers (http://highlycited.com)
11. SIAM Fellows Class of 2019 (https://www.siam.org/Prizes-Recognition/Fellows-Program/All-
SIAM-Fellows/Class-of-2019), retrieved 2019-09-01

External links
Joel A. Tropp professional home page (http://users.cms.caltech.edu/~jtropp/)

Retrieved from "https://en.wikipedia.org/w/index.php?title=Joel_Tropp&oldid=1260458708"

You might also like