Jump to content

Alan Edelman

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 80.43.95.77 (talk) at 01:11, 20 January 2021 (disambiguate ACM). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Alan Edelman
Edelman in 1999
BornJune 1963 (1963-06) (age 61)
Brooklyn, New York
NationalityAmerican
Alma materMIT, Yale University
Known for
Awards
Scientific career
FieldsMathematics
Computer Science
InstitutionsMIT
ThesisEigenvalues and Condition Numbers of Random Matrices (1989)
Doctoral advisorLloyd N. Trefethen[1]
Doctoral studentsIoana Dumitriu
Websitemath.mit.edu/~edelman/

Alan Stuart Edelman (born June 1963) is an American mathematician and computer scientist. He is a Professor of Applied Mathematics at the Massachusetts Institute of Technology and a Principal Investigator at the MIT Computer Science and AI Laboratory (CSAIL) where he leads a group in Applied Computing. In 2004 Professor Edelman founded Interactive Supercomputing, which was later acquired by Microsoft. Edelman is a fellow of AMS, SIAM, IEEE, and ACM for his contributions in numerical linear algebra, computational science, parallel computing and random matrix theory, and he is one of the co-creators for the technical computing language Julia.

Education

An alumnus of Hampshire College Summer Studies in Mathematics, Edelman received the B.S. and M.S. degrees in mathematics from Yale University in 1984, and the Ph.D. in applied mathematics from MIT in 1989 under the direction of Lloyd N. Trefethen. Following a year at Thinking Machines Corp and at CERFACS[4] in France, Edelman went to U.C. Berkeley as a Morrey Assistant Professor and Levy Fellow, 1990–93. He joined the MIT faculty in applied mathematics in 1993.

Research

Edelman's research interests include high-performance computing, numerical computation, linear algebra, and stochastic eigenanalysis (random matrix theory).

  • In random matrix theory, Edelman is most famous for the Edelman distribution of the smallest singular value of random matrices (also known as Edelman's law[5]), the invention of beta ensembles,[6] and the introduction of the stochastic operator approach.[7]
  • In high performance computing, Edelman is known for his work on parallel computing, as the co-founder of Interactive Supercomputing, as an inventor of the Julia programming language and for his work on The Future Fast Fourier Transform.

Awards

A Sloan fellow, Edelman received an NSF Faculty Career award in 1995. He has received numerous awards, among them the Gordon Bell Prize and Householder Prize (1990), the Chauvenet Prize (1998),[8] the Edgerly Science Partnership Award (1999), the SIAM Activity Group on Linear Algebra Prize (2000), and the Lester R. Ford Award,[9] (2005, with Gilbert Strang).

  • In 2011, Edelman was selected a Fellow of SIAM,[10] "for his contributions in bringing together mathematics and industry in the areas of numerical linear algebra, random matrix theory, and parallel computing."
  • In 2015, he became a Fellow of the American Mathematical Society[11] "for contributions to random matrix theory, numerical linear algebra, high-performance algorithms, and applications."
  • In 2017, he became an IEEE Fellow Class of 2018[12] "for contributions to the development of technical-computing languages."
  • In 2019, he was selected as the winner of Sidney Fernbach Award by IEEE Computer Society[13] "for outstanding breakthroughs in high-performance computing, linear algebra and computational science, and for contributions to the Julia programming language."
  • In 2021, he became an ACM Fellow of Class 2020[14] "for contributions to algorithms and languages for numerical and scientific computing."

See also

References

  1. ^ Alan Edelman at the Mathematics Genealogy Project
  2. ^ http://www-personal.umich.edu/~romanv/slides/2010-ICM/2010-ICM-Roman-Mark.pdf
  3. ^ From Random Matrices to Stochastic Operators: arXiv:math-ph/0607038
  4. ^ Cerfacs
  5. ^ http://www-personal.umich.edu/~romanv/slides/2010-ICM/2010-ICM-Roman-Mark.pdf
  6. ^ Matrix Models for Beta Ensembles: arXiv:math-ph/0206043
  7. ^ From Random Matrices to Stochastic Operators: arXiv:math-ph/0607038
  8. ^ Edelman, Alan; Kostlan, Eric (1995). "How Many Zeros of a Random Polynomial Are Real?". Bull. Amer. Math. Soc. (N.S.). 32: 1–37. arXiv:math/9501224. doi:10.1090/s0273-0979-1995-00571-9.
  9. ^ Edelman, Alan; Strang, Gilbert (2004). "Pascal matrices". Amer. Math. Monthly: 189–197. doi:10.2307/4145127.
  10. ^ SIAM Fellow Class of 2011: http://fellows.siam.org/index.php?sort=year&value=2011
  11. ^ List of Fellows of the American Mathematical Society
  12. ^ IEEE Fellow Class of 2018: https://www.ieee.org/membership_services/membership/fellows/2018_elevated_fellows.pdf Archived December 1, 2017, at the Wayback Machine
  13. ^ "Alan Edelman of MIT Recognized with Prestigious 2019 IEEE Computer Society Sidney Fernbach Award | IEEE Computer Society". Retrieved December 12, 2019.
  14. ^ https://www.acm.org/media-center/2021/january/fellows-2020
Retrieved from "https://en.wikipedia.org/w/index.php?title=Alan_Edelman&oldid=1001512823"