Improved bounds for the CF algorithm

DOI10.1016/j.tcs.2012.10.022zbMath1291.68436OpenAlexW1993041502MaRDI QIDQ385006

Elias P. Tsigaridas

Publication date: 29 November 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.10.022

Mathematics Subject Classification ID

Related Items (1)

A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration

Uses Software

• ISOLATE

Cites Work

• A deterministic algorithm for isolating real roots of a real polynomial
• Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
• A worst-case bound for topology computation of algebraic curves
• Implementations of a new theorem for computing bounds for positive roots of polynomials
• Faster algorithms for computing Hong's bound on absolute positiveness
• Optimal search for rationals
• An implementation of Vincent's theorem
• Bounds for absolute positiveness of multivariate polynomials
• Efficient isolation of polynomial's real roots.
• A new proof of Vincent's theorem
• Complexity of real root isolation using continued fractions
• On the complexity of the Descartes method when using approximate arithmetic
• New bounds for the Descartes method
• On the complexity of real root isolation using continued fractions
• Random polynomials and expected complexity of bisection methods for real solving
• Almost tight recursion tree bounds for the Descartes method
• Solving a Polynomial Equation: Some History and Recent Progress
• When Newton meets Descartes
• Real Algebraic Numbers: Complexity Analysis and Experimentation
• Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved bounds for the CF algorithm