On the maximum computing time of the bisection method for real root isolation

DOI10.1016/j.jsc.2016.02.017zbMath1358.65029OpenAlexW2307018641MaRDI QIDQ507151

George E. Collins

Publication date: 3 February 2017

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2016.02.017

zbMATH Keywords

dominancepolynomial rootsreal rootsbisection methodalgorithm analysisroot isolationcomputing time

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)

Uses Software

• ISOLATE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computing time of the continued fractions method
• Continued fraction real root isolation using the Hong root bound
• Efficient isolation of polynomial's real roots.
• Almost tight recursion tree bounds for the Descartes method

This page was built for publication: On the maximum computing time of the bisection method for real root isolation