World's Best Scientists 2026 revealed!

D-Index & Metrics

Mathematics

D-Index
43
Citations
13710
World Ranking
1649
National Ranking
710

Research.com Recognitions

  • 2011 - SIAM Fellow For contributions to numerical linear algebra.

Overview

Beresford N. Parlett is a researcher affiliated with the University of California, Berkeley in the United States. Their work spans multiple fields, primarily focusing on computer science, physics and astronomy, and mathematics.

Their research includes contributions in several subfields, such as computational theory and mathematics, statistical and nonlinear physics, geometry and topology, numerical analysis, and atomic and molecular physics and optics.

The main topics covered by Beresford N. Parlett include:

  • Matrix Theory and Algorithms
  • Advanced Mathematical Theories and Applications
  • Graph Theory and Applications
  • Advanced Optimization Algorithms Research
  • Electromagnetic Scattering and Analysis

Beresford N. Parlett has coauthored papers, notably with Carla Ferreira. Their frequent co-author is:

  • Carla Ferreira

Publication venues for Beresford N. Parlett include:

  • SIAM Journal on Matrix Analysis and Applications
  • Numerische Mathematik

Two recent papers authored include:

  • "Eigenpairs of Wilkinson Matrices," published in 2020 in the SIAM Journal on Matrix Analysis and Applications
  • "A real triple dqds algorithm for the nonsymmetric tridiagonal eigenvalue problem," published in 2022 in Numerische Mathematik

In recognition of their work, Beresford N. Parlett was named a SIAM Fellow in 2011 for contributions to numerical linear algebra.

Best Publications

  • The Symmetric Eigenvalue Problem

    Beresford N. Parlett

  • Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations

    J. R. Bunch;B. N. Parlett

  • The Lanczos algorithm with selective orthogonalization

    B. N. Parlett;D. S. Scott

  • On generalized successive overrelaxation methods for augmented linear systems

    Zhong-Zhi Bai;Beresford N. Parlett;Zeng-Qi Wang

  • Approximate solutions and eigenvalue bounds from Krylov subspaces

    Chris C. Paige;Beresford N. Parlett;Henk A. van der Vorst

  • A Look Ahead Lanczos Algorithm for Unsymmetric Matrices

    B. N. Parlett;D. Taylor

  • Accurate Singular Values and Differential QD Algorithms

    K. V. Fernando;Beresford N. Parlett

  • The Rayleigh Quotient Iteration and Some Generalizations for Nonnormal Matrices

    B. N. Parlett

  • Balancing a matrix for calculation of eigenvalues and eigenvectors

    B. N. Parlett;C. Reinsch

  • Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices

    Inderjit S. Dhillon;Beresford N. Parlett

  • Orthogonal Eigenvectors and Relative Gaps

    Inderjit S. Dhillon;Beresford N. Parlett

  • Reduction to tridiagonal form and minimal realizations

    Beresford N. Parlett

  • A new look at the Lanczos algorithm for solving symmetric systems of linear equations

    B.N. Parlett

  • Decomposition of a symmetric matrix

    James R. Bunch;Linda Kaufman;Beresford N. Parlett

  • A recurrence among the elements of functions of triangular matrices

    B.N. Parlett

  • Residual Bounds on Approximate Eigensystems of Nonnormal Matrices

    W. Kahan;B. N. Parlett;E. Jiang

  • Laguerre's Method Applied to the Matrix Eigenvalue Problem

    Beresford Parlett

  • The design and implementation of the MRRR algorithm

    Inderjit S. Dhillon;Beresford N. Parlett;Christof Vömel

  • Lanczos versus subspace iteration for solution of eigenvalue problems

    Bahram Nour-Omid;Beresford N. Parlett;Robert L. Taylor

  • Performance and Accuracy of LAPACK's Symmetric Tridiagonal Eigensolvers

    James W. Demmel;Osni A. Marques;Beresford N. Parlett;Christof Vömel

  • The Symmetric Eigenvalue Problem.

    James H. Wilkinson;Beresford N. Parlett

Frequent Co-Authors

Inderjit S. Dhillon
Inderjit S. Dhillon Google (United States)
James Demmel
James Demmel University of California, Berkeley
Jakub Kurzak
Jakub Kurzak Advanced Micro Devices (Canada)
Piotr Luszczek
Piotr Luszczek University of Tennessee at Knoxville
Stanimire Tomov
Stanimire Tomov University of Tennessee at Knoxville
Jack Dongarra
Jack Dongarra University of Tennessee at Knoxville
Michael A. Saunders
Michael A. Saunders Stanford University
Raymond H. Chan
Raymond H. Chan Lingnan University
Michele Benzi
Michele Benzi Scuola Normale Superiore di Pisa
Jan S. Hesthaven
Jan S. Hesthaven Karlsruhe Institute of Technology

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in studying Mathematics in the USA, there are various related online degrees that expand career opportunities. Fields like data analysis rely heavily on mathematical skills, and pursuing data analysis programs can provide advanced expertise in interpreting complex datasets, a valuable asset in industries from finance to healthcare.

For those considering leadership roles and business acumen in addition to quantitative skills, enrolling in one of the easiest MBA programs may offer a flexible and approachable pathway to gaining management knowledge.

Similarly, some students might prefer the convenience of easiest MBA programs available entirely online, blending accessibility with reputable business education to accelerate career growth without sacrificing study time.

For those aiming to reach the highest levels of expertise and leadership, enrolling in dba programs online can prepare graduates for advanced research, consulting, or executive roles, complementing a rigorous mathematical foundation with strategic business insights.

Best Scientists Citing Beresford N. Parlett

Trending Scientists