You are here

How Many Zeros of a Random Polynomial are Real?

by Alan Edelman, Eric Kostlan

Year of Award: 1998

Award: Chauvenet

Publication Information: Bulletin of the AMS, vol. 32 (1995), pp.1-37


Read the Article (This is a large file: 27.82MB.)

About the Authors

Alan Edelman, a lifelong lover of linear algebra, recently celebrated his fortieth birthday with a cake bought by his wife with icing Ax = λx. He earned a B.S. and M.S. at Yale University and a Ph.D. at MIT, where he has been teaching since 1993.  He has also spent three years at UC Berkeley. Edelman's thesis on random matrices was supervised by Nick Trefethen (and a book is in progress). Random matrices, parallel computing, and numerical linear algebra remain passions. He has shared a Gordon Bell Prize for parallel computing, a Householder Prize for numerical linear algebra, and the MAA's Chauvenet Prize.

Eric Kostlan received his PhD at the University of California, Berkeley in 1985. At the time of the writing of the article, he was on the faculty at Kapiolani Community College. As of 2010, he is an  education specialist at Cisco Systems.

Subject classification(s): Index
Publication Date: 
Friday, October 10, 2008