Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

   
Mobile Device Pairing
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)

 

The QR algorithm and Hyman's method on vector computers


Author: Robert C. Ward
Journal: Math. Comp. 30 (1976), 132-142
MSC: Primary 65F15
MathSciNet review: 0405825
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: The implementation on vector computers of the QR algorithm and of iterative schemes based on obtaining the determinant and its derivatives by Hyman's method are presented. It is shown that iterative schemes based on Hyman's method will probably be more efficient than the QR algorithm on vector computers for large matrices. A theoretical comparison of the Laguerre iterative scheme with the QR algorithm is presented using the latest available CDC STAR-100 instruction execution times. In addition, the results of several test cases run on the Laguerre-Hyman algorithm on a serial computer are reported.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 65F15

Retrieve articles in all journals with MSC: 65F15


Additional Information

DOI: http://dx.doi.org/10.1090/S0025-5718-1976-0405825-9
PII: S 0025-5718(1976)0405825-9
Keywords: Vector computers, eigenvalues, QR algorithm, Hyman's method
Article copyright: © Copyright 1976 American Mathematical Society