The QR algorithm
Beresford Ν. Parlett · Computing in Science & Engineering · 2000
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.