The LR and QR algorithms, two of the best available iterative methods for finding the eigenvalues of a nonsymmetric matrix associated with a system of linear homogeneous equations, are studied. These algorithms are discussed as they apply to the determination of the eigenvalues of real nonsymmetric matrices.
A comparison of the speed and accuracy of these transformations is made. A detailed discussion of the criterion for convergence and the numerical difficulties which may occur in the computation of multiple and complex conjugate eigenvalues are included.
The results of this study indicate that the QR algorithm is the more successful method for finding the eigenvalues of a real nonsymmetric matrix --Abstract, page ii
