This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The QR Algorithm
January/February 2000 (vol. 2 no. 1)
pp. 38-42
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.
Citation:
Beresford N. Parlett, "The QR Algorithm," Computing in Science and Engineering, vol. 2, no. 1, pp. 38-42, Jan.-Feb. 2000, doi:10.1109/5992.814656
Usage of this product signifies your acceptance of the Terms of Use.