On the maximum computing time of the bisection method for real root isolation
From MaRDI portal
Publication:507151
DOI10.1016/J.JSC.2016.02.017zbMATH Open1358.65029OpenAlexW2307018641MaRDI QIDQ507151FDOQ507151
Authors: 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
Recommendations
- Near optimal subdivision algorithms for real root isolation
- Near optimal subdivision algorithms for real root isolation
- Real Root Isolation of Polynomial Equations Based on Hybrid Computation
- On the complexity of real root isolation using continued fractions
- A simple but exact and efficient algorithm for complex root isolation
- Certified numerical real root isolation for bivariate polynomial systems
- An improved algorithm for real root isolation of univariate polynomials
- An efficient real root isolation algorithm for a zero-dimensional triangular polynomial system
- A new method for real root isolation of univariate polynomials
- scientific article; zbMATH DE number 1263360
Complexity and performance of numerical algorithms (65Y20) Numerical computation of roots of polynomial equations (65H04)
Cites Work
- Efficient isolation of polynomial's real roots.
- Title not available (Why is that?)
- Almost tight recursion tree bounds for the Descartes method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the computing time of the continued fractions method
- Continued fraction real root isolation using the Hong root bound
Cited In (2)
Uses Software
This page was built for publication: On the maximum computing time of the bisection method for real root isolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507151)
