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.
- J. G. F. Francis, The $QR$ transformation: a unitary analogue to the $LR$ transformation. I, Comput. J. 4 (1961/62), 265–271. MR 130111, DOI 10.1093/comjnl/4.3.265
- Robert T. Gregory and David L. Karney, A collection of matrices for testing computational algorithms, Wiley-Interscience [A division of John Wiley & Sons, Inc.], New York-London-Sydney, 1969. MR 0253538 L. M. HOWSER & J. J. LAMBIOTTE, JR., STAR Adaption for Two Algorithms Used on Serial Computers, NASA Technical Memorandum X-3003, June 1974.
- Beresford Parlett, Laguerre’s method applied to the matrix eigenvalue problem, Math. Comp. 18 (1964), 464–485. MR 165668, DOI 10.1090/S0025-5718-1964-0165668-2
- J. H. Wilkinson, The algebraic eigenvalue problem, Clarendon Press, Oxford, 1965. MR 0184422
- Handbook for automatic computation. Vol. II, Die Grundlehren der mathematischen Wissenschaften, Band 186, Springer-Verlag, New York-Heidelberg, 1971. Linear algebra; Compiled by J. H. Wilkinson and C. Reinsch. MR 0461856
- © Copyright 1976 American Mathematical Society
- Journal: Math. Comp. 30 (1976), 132-142
- MSC: Primary 65F15
- DOI: https://doi.org/10.1090/S0025-5718-1976-0405825-9
- MathSciNet review: 0405825