Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

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
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 65.40
  • Retrieve articles in all journals with MSC: 65.40
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