On the computation of the eigenvalues of a tridiagonal matrix
HTML articles powered by AMS MathViewer
- by I. Gargantini PDF
- Math. Comp. 23 (1969), 403-405 Request permission
Abstract:
A recent algorithm for the simultaneous approximation of all zeros of a polynomial is applied to the computation of the eigenvalues of a tridiagonal matrix. The method works in the presence of multiplicity and degeneracy and has been tested in a multitude of cases ; its practical limitation on a computer is the large number of locations required for matrices of high order.References
- Peter Henrici and Irene Gargantini, Uniformly convergent algorithms for the simultaneous approximation of all zeros of a polynomial, Constructive Aspects of the Fundamental Theorem of Algebra (Proc. Sympos., Zürich-Rüschlikon, 1967) Wiley-Interscience, New York, 1969, pp. 77–113. MR 0256553
Additional Information
- © Copyright 1969 American Mathematical Society
- Journal: Math. Comp. 23 (1969), 403-405
- MSC: Primary 65.40
- DOI: https://doi.org/10.1090/S0025-5718-1969-0242359-5
- MathSciNet review: 0242359