On the maximum computing time of the bisection method for real root isolation
type: Item
instance of: scholarly article
title: On the maximum computing time of the bisection method for real root isolation
zbMATH Open document ID: 1358.65029
author: George E. Collins
published in: Journal of Symbolic Computation
publication date: 2017-02-03T00:00:00Z
Mathematics Subject Classification ID: 65H04
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 6680380
zbMATH Keywords: polynomial roots
zbMATH Keywords: real roots
zbMATH Keywords: root isolation
zbMATH Keywords: computing time
zbMATH Keywords: algorithm analysis
zbMATH Keywords: dominance
zbMATH Keywords: bisection method
describes a project that uses: ISOLATE
MaRDI profile type: Publication
full work available at URL: j.jsc.2016.02.017
OpenAlex ID: W2307018641
cites work: Continued fraction real root isolation using the Hong root bound
cites work: On the computing time of the continued fractions method
cites work: Almost tight recursion tree bounds for the Descartes method
cites work: Q3259107
cites work: Q4391224
cites work: Q5797046
cites work: Q3933736
cites work: Efficient isolation of polynomial's real roots.
DOI: 10.1016/J.JSC.2016.02.017
Recommended article: Near optimal subdivision algorithms for real root isolation
Recommended article: Real Root Isolation of Polynomial Equations Based on Hybrid Computation
Recommended article: On the complexity of real root isolation using continued fractions
Recommended article: A simple but exact and efficient algorithm for complex root isolation
Recommended article: Certified Numerical Real Root Isolation for Bivariate Polynomial Systems
Recommended article: Q3169977
Recommended article: Q3307030
Recommended article: A new method for real root isolation of univariate polynomials
Recommended article: Q4234241
description: scientific article; zbMATH DE number 6680380