The QR algorithm: 50 years later its genesis by John Francis and Vera Kublanovskaya and subsequent developments

DOI10.1093/imanum/drp012zbMath1169.65032OpenAlexW1973942615WikidataQ56675066 ScholiaQ56675066MaRDI QIDQ5323971

Frank Uhlig, Gene H. Golub

Publication date: 3 August 2009

Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/081733a5dc2678beddc5d66ab8311bc6a776d637

zbMATH Keywords

numerical algorithmQR algorithmmatrix eigenvaluehistory of computationmatrix computationFrancis implicit Q theoremhistory of mathJohn Francismatrix eigenvectorVera Kublanovskaya

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) History of mathematics in the 20th century (01A60) History of numerical analysis (65-03)

Related Items (6)

Rutishauser’s LR algorithm and Bruhat iteration ⋮ Kernel polynomials from \(L\)-orthogonal polynomials ⋮ Implicit QR for rank-structured matrix pencils ⋮ The subspaces spanned by Householder vectors associated with an orthogonal or a symplectic matrix ⋮ Implicit QR with compression ⋮ The numerical Jordan form

Uses Software

• POOCLAPACK

This page was built for publication: The QR algorithm: 50 years later its genesis by John Francis and Vera Kublanovskaya and subsequent developments