From qd to LR, or, how were the qd and LR algorithms discovered?
From MaRDI portal
Publication:3088335
DOI10.1093/imanum/drq003zbMath1222.65032OpenAlexW1970208471WikidataQ56341677 ScholiaQ56341677MaRDI QIDQ3088335
Martin H. Gutknecht, Beresford N. Parlett
Publication date: 19 August 2011
Published in: IMA Journal of Numerical Analysis (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/299139/files/drq003.pdf
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 ⋮ A tridiagonal matrix construction by the quotient difference recursion formula in the case of multiple eigenvalues ⋮ The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods ⋮ Accurate quotient-difference algorithm: error analysis, improvements and applications ⋮ Computing recursive orthogonal polynomial with Schur complements ⋮ PACF: a precision-adjustable computational framework for solving singular values
This page was built for publication: From qd to LR, or, how were the qd and LR algorithms discovered?
