An algorithm for locating all zeros of a real polynomial

DOI10.1007/BF02238233zbMath0844.65042OpenAlexW1587987493MaRDI QIDQ1893153

F. Locher, Michael-Ralf Skrzipek

Publication date: 25 July 1995

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02238233

zbMATH Keywords

global convergenceiterative algorithmsNewton methodstability testzeros of a real polynomialBairstrow method

Mathematics Subject Classification ID

Related Items (2)

Sorting-based localization and stable computation of zeros of a polynomial. I. ⋮ Parameter estimation and signal reconstruction

Cites Work

• Unnamed Item
• Unnamed Item
• A bibliography on roots of polynomials
• A stability test for real polynomials
• Detection and validation of clusters of polynomial zeros
• Counting Zeros of Real Polynomials within the Unit Disk
• A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane

This page was built for publication: An algorithm for locating all zeros of a real polynomial