Continued fraction real root isolation using the Hong root bound
algorithm analysiscontinued fractionsdominancemaximum computing timepolynomial rootsreal rootsroot boundsroot isolation
Continued fractions (11A55) Continued fraction calculations (number-theoretic aspects) (11Y65) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Real polynomials: location of zeros (26C10) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Numerical computation of roots of polynomial equations (65H04) Complexity and performance of numerical algorithms (65Y20) Symbolic computation and algebraic computation (68W30)
- Complexity of real root isolation using continued fractions
- Complexity of real root isolation using continued fractions
- On the complexity of real root isolation using continued fractions
- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
- scientific article; zbMATH DE number 3881778
- Continued fraction expansion of real roots of polynomial systems
- The Hurwitz continued fraction expansion as applied to real numbers
- Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds
- scientific article; zbMATH DE number 3960882
- On real continued fractions
- Bounds for absolute positiveness of multivariate polynomials
- Complexity of real root isolation using continued fractions
- scientific article; zbMATH DE number 3141365 (Why is no real title available?)
- scientific article; zbMATH DE number 1253962 (Why is no real title available?)
- scientific article; zbMATH DE number 3057883 (Why is no real title available?)
- On the computing time of the continued fractions method
- Sur la vie et l'oeuvre de François Budan (1761--1840). (On the life and work of F. Budan)
- The Computing Time of the Euclidean Algorithm
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Advances on the Continued Fractions Method Using Better Estimations of Positive Root Bounds
- Computing real roots of real polynomials
- On the maximum computing time of the bisection method for real root isolation
- On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity
This page was built for publication: Continued fraction real root isolation using the Hong root bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492021)