Authority control databases
| International | |
|---|---|
| National | |
| Academics | |
Beresford Parlett | |
|---|---|
| Born | July 4, 1932 London, England |
| Alma mater | University of Oxford (B.A.) Stanford University (Ph.D.) |
| Scientific career | |
| Fields | Numerical analysis |
| Institutions | University of California, Berkeley |
| Thesis | I. Bundles of Matrices and the Linear Independence of Their Minors; II. Applications of Laguerre's Method to the Matrix Eigenvalue Problem[1] (1962) |
| Doctoral advisor | George Forsythe |
| Doctoral students | Inderjit Dhillon Anne Greenbaum |
Beresford Neill Parlett (born 1932) is an English applied mathematician, specializing in numerical analysis and scientific computation.[2]
Parlett received in 1955 his bachelor's degree in mathematics from the University of Oxford and then worked in his father's timber business for three years. From 1958 to 1962 he was a graduate student in mathematics at Stanford University, where he received his Ph.D. in 1962. He was a postdoc for two years at Manhattan's Courant Institute and one year at the Stevens Institute of Technology. From 1965 until his retirement, he was a faculty member of the mathematics department at the University of California, Berkeley. There he served for some years as chair of the department of computer science, director of the Center for Pure and Applied Mathematics, and professor in the department of electrical engineering and computer science. He was a visiting professor at the University of Toronto, Pierre and Marie Curie University (Paris VI), and the University of Oxford.[3]
Parlett is the author of many influential papers on the numerical solution of eigenvalue problems, the QR algorithm, the Lanczos algorithm, symmetric indefinite systems, and sparse matrix computations.[3]
