Masters Theses
Abstract
"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.
Advisor(s)
Lee, Ralph E.
Committee Member(s)
Gillett, Billy E.
Wellek, Robert M.
Alcorn, Herbert R., 1933-2008
Department(s)
Computer Science
Degree Name
M.S. in Computer Science
Publisher
University of Missouri at Rolla
Publication Date
1966
Pagination
iv, 48 pages
Note about bibliography
Includes bibliographical references (page 47).
Rights
© 1966 Susan Clara Hanson, All rights reserved.
Document Type
Thesis - Open Access
File Type
text
Language
English
Subject Headings
Eigenvalues
Nonsymmetric matrices
Algorithms
Thesis Number
T 1863
Print OCLC #
5973337
Electronic OCLC #
896827813
Link to Catalog Record
Recommended Citation
Hanson, Susan Clara, "A comparison of the LR and QR transformations for finding the eigenvalues for real nonsymmetric matrices" (1966). Masters Theses. 5740.
https://scholarsmine.mst.edu/masters_theses/5740
