A method for computing all the zeros of a polynomial with real coefficients

DOI10.1007/BF01930986zbMath0453.65025MaRDI QIDQ3900917

T. L. Freeman

Publication date: 1979

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

zeros of a polynomialreal coefficientsdamped Newton method

Mathematics Subject Classification ID

Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items (2)

A divide and conquer method for polynomial zeros ⋮ Inner product quadrature formulas exact on maximal product spaces of functions

Cites Work

• Unnamed Item
• Unnamed Item
• Factorizing symmetric indefinite matrices
• Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen
• Minimization of functions having Lipschitz continuous first partial derivatives
• Algorithms for confluent Vandermonde systems
• A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
• On Bairstow's Method for the Solution of Polynomial Equations
• Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
• Finding zeros of a polynomial by the Q-D algorithm
• Corrections to numerical data on Q-D algorithm

This page was built for publication: A method for computing all the zeros of a polynomial with real coefficients