Beresford Parlett

{{short description|British applied mathematician (born 1932)}}

{{Infobox scientist

| name =

| image = Beresford Parlett Berkeley 2018.jpg

| landscape = yes

| caption = Parlett at UC Berkeley in 2018

| birth_date = {{birth date and age|1932|07|04}}

| birth_place = London, England

| death_date =

| death_place =

| field = Numerical analysis

| work_institution = University of California, Berkeley

| alma_mater = University of Oxford (B.A.)
Stanford University (Ph.D.)

| thesis_title = I. Bundles of Matrices and the Linear Independence of Their Minors; II. Applications of Laguerre's Method to the Matrix Eigenvalue Problem{{MathGenealogy|id=32898|name=Beresford Neill Parlett}}

| thesis_year = 1962

| doctoral_advisor = George Forsythe

| doctoral_students = Inderjit Dhillon
Anne Greenbaum

| known_for =

| author_abbreviation_bot =

| author_abbreviation_zoo =

| prizes =

| religion =

| footnotes =

}}

Beresford Neill Parlett (born 1932) is an English applied mathematician, specializing in numerical analysis and scientific computation.{{cite web|title=Beresford N. Parlett|website=Mathematics Department, U. C. Berkeley|url=https://math.berkeley.edu/people/faculty/beresford-n-parlett}}

Education and career

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.{{cite journal|author=Bunch, James R.|title=Editorial (introducing special issue dedicated to Beresford Parlett and William Kahan on their 60th birthdays)|journal=Numerical Linear Algebra with Applications|volume=2|issue=2|year=1995|page=85|doi=10.1002/nla.1680020202|doi-access=}} (See William Kahan.)

{{blockquote|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.}}

Awards and honours

  • 2006 — (jointly with Inderjit S. Dhillon) SIAM Activity Group Linear Algebra Best Paper Prize{{cite web|title=Prize History|website=SIAM Activity Group on Linear Algebra Best Paper Prize, SIAM|url=https://www.siam.org/Prizes-Recognition/Activity-Group-Prizes/Detail/siag-linear-algebra-prize#Prize-History}}
  • 2010 — Hans Schneider Prize in Linear Algebra{{cite web|title=Beresford N. Parlett|website=Electrical Engineering and Computer Sciences, U. C. Berkeley|url=https://www2.eecs.berkeley.edu/Faculty/Homepages/parlett.html}}
  • 2011 — Society for Industrial and Applied Mathematics (SIAM) Fellow

Selected publications

=Articles=

  • {{cite journal|doi=10.1007/BF02165404|title=Balancing a matrix for calculation of eigenvalues and eigenvectors|journal=Numerische Mathematik|volume=13|issue=4|pages=293–304|year=1969|last1=Parlett|first1=B. N.|last2=Reinsch|first2=C.|s2cid=122353612}}
  • {{cite journal|doi=10.1137/0708060|title=Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations|journal=SIAM Journal on Numerical Analysis|volume=8|issue=4|pages=639–655|year=1971|last1=Bunch|first1=J. R.|last2=Parlett|first2=B. N.|bibcode=1971SJNA....8..639B}}
  • {{cite journal|doi=10.1090/s0025-5718-1974-0405823-3|title=The Rayleigh quotient iteration and some generalizations for nonnormal matrices|journal=Mathematics of Computation|volume=28|issue=127|pages=679|year=1974|last1=Parlett|first1=B. N.|doi-access=free}}
  • {{cite journal|doi=10.1090/s0025-5718-1979-0514820-3|title=The Lanczos algorithm with selective orthogonalization|journal=Mathematics of Computation|volume=33|issue=145|pages=217–238|year=1979|last1=Parlett|first1=B. N.|last2=Scott|first2=D. S.|doi-access=free|hdl=2060/19790002294|hdl-access=free}}
  • {{cite journal|doi=10.1137/0719030|title=Residual Bounds on Approximate Eigensystems of Nonnormal Matrices|journal=SIAM Journal on Numerical Analysis|volume=19|issue=3|pages=470–484|year=1982|last1=Kahan|first1=W.|author-link=William Kahan|last2=Parlett|first2=B. N.|last3=Jiang|first3=E.|bibcode=1982SJNA...19..470K}}
  • {{cite journal|doi=10.1090/s0025-5718-1985-0771034-2|title=A look-ahead Lánczos algorithm for unsymmetric matrices|journal=Mathematics of Computation|volume=44|issue=169|pages=105|year=1985|last1=Parlett|first1=Beresford N.|last2=Taylor|first2=Derek R.|last3=Liu|first3=Zhishun A.|doi-access=free}}
  • {{cite journal|doi=10.1090/s0025-5718-1987-0878698-5|title=How to implement the spectral transformation|journal=Mathematics of Computation|volume=48|issue=178|pages=663|year=1987|last1=Nour-Omid|first1=Bahram|last2=Parlett|first2=Beresford N.|last3=Ericsson|first3=Thomas|last4=Jensen|first4=Paul S.|doi-access=free}}
  • {{cite journal|doi=10.1090/S0273-0979-1992-00239-2|title=Some basic information on information-based complexity theory|journal=Bulletin of the American Mathematical Society|volume=26|pages=3–29|year=1992|last1=Parlett|first1=Beresford N.|doi-access=free|arxiv=math/9201266}}{{cite journal|author=Hirsch, Morris W.|author-link=Morris Hirsch|author2=Palais, Richard S.|authorlink2=Richard S. Palais|title=Editors' remarks (on two complexity theory surveys in the Bulletin)|year=1992|arxiv=math/9201262|journal=Bulletin of the American Mathematical Society |series=New Series |volume=26 |pages= 1–2|doi=10.1090/S0273-0979-1992-00238-0}}
  • {{cite journal|doi=10.1007/s002110050024|title=Accurate singular values and differential qd algorithms|journal=Numerische Mathematik|volume=67|issue=2|pages=191–229|year=1994|last1=Fernando|first1=K. Vince|last2=Parlett|first2=Beresford N.|s2cid=7635226}}
  • {{cite journal|doi=10.1002/nla.1680020205|title=Approximate solutions and eigenvalue bounds from Krylov subspaces|journal=Numerical Linear Algebra with Applications|volume=2|issue=2|pages=115–133|year=1995|last1=Paige|first1=Chris C.|last2=Parlett|first2=Beresford N.|last3=Van Der Vorst|first3=Henk A.|authorlink3=Henk van der Vorst}}
  • {{cite journal|doi=10.1016/j.laa.2003.12.028|title=Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices|journal=Linear Algebra and Its Applications|volume=387|pages=1–28|year=2004|last1=Dhillon|first1=Inderjit S.|last2=Parlett|first2=Beresford N.|doi-access=free}}
  • {{cite journal|doi=10.1007/s00211-005-0643-0|title=On generalized successive overrelaxation methods for augmented linear systems|journal=Numerische Mathematik|volume=102|pages=1–38|year=2005|last1=Bai|first1=Zhong-Zhi|last2=Parlett|first2=Beresford N.|last3=Wang|first3=Zeng-Qi|s2cid=19189312}}
  • {{cite journal|last1=Shomron|first1=Noam|last2=Parlett|first2=Beresford N.|title=Linear Algebra meets Lie Algebra: The Kostant–Wallach theory|journal=Linear Algebra and Its Applications|volume=431|issue=10|year=2009|pages=1745–1767|issn=0024-3795|doi=10.1016/j.laa.2009.06.007|arxiv=0809.1204|s2cid=115167499}} [https://arxiv.org/abs/0809.1204 arXiv preprint] (See Bertram Kostant and Nolan Wallach.)

=Books=

  • {{cite book|url=https://books.google.com/books?id=BM9rtF9cu7gC|title = The Symmetric Eigenvalue Problem|isbn = 9781611971163|last1 = Parlett|first1 = Beresford N.|date = January 1998|publisher=SIAM|location=Philadelphia|postscript=;}} SIAM corrected edition of the original publication by Prentice-Hall in 1980{{cite journal|doi=10.1090/s0273-0979-1981-14918-1|title=Book Review: The symmetric eigenvalue problem|journal=Bulletin of the American Mathematical Society|volume=4|issue=3|pages=368–374|year=1981|last1=Stewart|first1=G. W.|doi-access=free}}

References

{{reflist}}