Finding zeros of a polynomial by the Q-D algorithm

DOI10.1145/365559.365619MaRDI QIDQ5343729zbMATH OpenOpenAlexWikidataFDO

Authors 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

Cited in

(15)

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

This page was built for publication: Finding zeros of a polynomial by the Q-D algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5343729)