Year: 1973
Type: article
Abstract: Bernoulli methods are reviewed in terms of matrix eigenvalue techniques applied to the companion matrix of a polynomial.Inverse iteration gives rise to two implicit-shift algorithms when apphed to the companion matrix and to its transpose.The first is the algorithm of Jenkins and Traub; the second is a new form which is a direct extension of the Bernoulli recurrence.Equivalence theorems for the two algorithms are given and the computational aspects of the latter algorithm are discussed.
Source: Journal of the ACM
Author: M. A. Jenkins
Institution: Queen's University
Language: English
Topic: Matrix Theory and Algorithms
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W1967149248