The Community for Technology Leaders
Green Image
Issue No. 01 - January/February (2000 vol. 2)
ISSN: 1521-9615
pp: 38-42
ABSTRACT
A brief sketch of the early days of eigenvalue hunting is followed by a description of the QR 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 essay to a close.
INDEX TERMS
CITATION
Beresford N. Parlett, "The QR Algorithm", Computing in Science & Engineering, vol. 2, no. , pp. 38-42, January/February 2000, doi:10.1109/5992.814656
116 ms
(Ver )