A constructive algorithm for finding the exact roots of polynomials with computable real coefficients.

DOI10.1016/S0304-3975(00)00426-6zbMath1035.65049MaRDI QIDQ1603892

Scott Chambers, Heoi Lee Lu, David R. Lester

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

error analysispolynomial rootscomputable arithmeticJenkins' and Traub's algorithm

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05) Real polynomials: location of zeros (26C10)

Related Items

Comparing representations for function spaces in computable analysis ⋮ Intersection of a ruled surface with a free-form surface

Uses Software

• Haskell
• mctoolbox

Cites Work

• A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration
• A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item