On the maximum computing time of the bisection method for real root isolation
From MaRDI portal
(Redirected from Publication:507151)
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
Cites work
- scientific article; zbMATH DE number 3141365 (Why is no real title available?)
- scientific article; zbMATH DE number 3750284 (Why is no real title available?)
- scientific article; zbMATH DE number 1157659 (Why is no real title available?)
- scientific article; zbMATH DE number 3057883 (Why is no real title available?)
- Almost tight recursion tree bounds for the Descartes method
- Continued fraction real root isolation using the Hong root bound
- Efficient isolation of polynomial's real roots.
- On the computing time of the continued fractions method
Cited in
(2)
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)