The QR Algorithm

Authors:
Beresford N. Parlett
Affiliations:
-
Venue:
Computing in Science and Engineering
Year:
2000

Citing 3
Cited 0

Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
The symmetric eigenvalue problem

The symmetric eigenvalue problem
LAPACK Users' guide (third ed.)

LAPACK Users' guide (third ed.)

Quantified Score

Hi-index	0.00

Visualization

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.