• DocumentCode
    1285120
  • Title

    The QR algorithm

  • Author

    Parlett, Beresford N.

  • Author_Institution
    California Univ., Berkeley, CA, USA
  • Volume
    2
  • Issue
    1
  • fYear
    2000
  • Firstpage
    38
  • Lastpage
    42
  • Abstract
    After a brief sketch of the early days of eigenvalue hunting, the author describes the QR (or orthogonal triangular) matrix factorization algorithm and its major virtues. The symmetric case brings with it guaranteed convergence and an elegant implementation. An account of the impressive discovery of the algorithm brings the article to a close
  • Keywords
    convergence of numerical methods; eigenvalues and eigenfunctions; history; matrix decomposition; QR algorithm; eigenvalues; guaranteed convergence; history; orthogonal triangular matrix factorization; symmetric case; Algorithm design and analysis; Arithmetic; Convergence; Eigenvalues and eigenfunctions; Gaussian processes; History; Polynomials; Quantum computing; Quantum mechanics; Symmetric matrices;
  • fLanguage
    English
  • Journal_Title
    Computing in Science & Engineering
  • Publisher
    ieee
  • ISSN
    1521-9615
  • Type

    jour

  • DOI
    10.1109/5992.814656
  • Filename
    814656
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1285120