"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.
Lee, Ralph E.
Gillett, Billy E.
Wellek, Robert M.
Alcorn, Herbert R., 1933-2008
M.S. in Computer Science
University of Missouri at Rolla
iv, 48 pages
© 1966 Susan Clara Hanson, All rights reserved.
Thesis - Open Access
Library of Congress Subject Headings
Print OCLC #
Electronic OCLC #
Link to Catalog Record
Hanson, Susan Clara, "A comparison of the LR and QR transformations for finding the eigenvalues for real nonsymmetric matrices" (1966). Masters Theses. 5740.