Finding zeros of a polynomial by the Q-D algorithm

DOI10.1145/365559.365619zbMath0133.37903OpenAlexW2061745356WikidataQ128659613 ScholiaQ128659613MaRDI QIDQ5343729

Peter Henrici, B. O. Watkins

Publication date: 1965

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/365559.365619

zbMATH Keywords

numerical analysis

Related Items

Finding roots of a real polynomial simultaneously by means of Bairstow's method, A Numerical Method for Locating the Zeros of an Analytic Function, On a test of programs for numerical zeros of polynomials, A tridiagonal matrix construction by the quotient difference recursion formula in the case of multiple eigenvalues, On Newton's method with a class of rational functions, A divide and conquer method for polynomial zeros, Accurate quotient-difference algorithm: error analysis, improvements and applications, An iteration formula for the simultaneous determination of the zeros of a polynomial, An algorithm for the total, or partial, factorization of a polynomial, A method for computing all the zeros of a polynomial with real coefficients, A parallel algorithm for simple roots of polynomials, Circular arithmetic and the determination of polynomial zeros, The polynomial pivots as initial values for a new root-finding iterative method, Locating multiple zeros interactively