Finding zeros of a polynomial by the Q-D algorithm

Authors:
P. Henrici;Bruce O. Watkins
Affiliations:
Univ. of California, Los Angeles, and Technische Hochschule, Zurich, Switzerland;Utah State Univ., Logan
Venue:
Communications of the ACM
Year:
1965

Citing 0
Cited 6

Error Bounds for Zeros of a Polynomial Based Upon Gerschgorin's Theorems

Journal of the ACM (JACM)
A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane

Journal of the ACM (JACM)
A stopping criterion for polynomial root finding

Communications of the ACM
Corrections to numerical data on Q-D algorithm

Communications of the ACM
SIGNUM subroutine certification committee

ACM SIGNUM Newsletter
Paper: Asynchronous polynomial zero-finding algorithms

Parallel Computing

Quantified Score

Hi-index	48.26

Visualization

Abstract

A method which finds simultaneously all the zeros of a polynomial, developed by H. Rutishauser, has been tested on a number of polynomials with real coefficients. This slowly converging method (the Quotient-Difference (Q-D) algorithm) provides starting values for a Newton or a Bairstow algorithm for more rapid convergence.Necessary and sufficient conditions for the existence of the Q-D scheme are not completely known; however, failure may occur when zeros have equal, or nearly equal magnitudes. Success was achieved, in most of the cases tried, with the failures usually traceable to the equal magnitude difficulty. In some cases, computer roundoff may result in errors which spoil the scheme. Even if the Q-D algorithm does not give all the zeros, it will usually find a majority of them.