On the complexity of real root isolation using continued fractions
From MaRDI portal
Publication:2476019
DOI10.1016/J.TCS.2007.10.010zbMATH Open1134.68067OpenAlexW2168222442WikidataQ57908743 ScholiaQ57908743MaRDI QIDQ2476019FDOQ2476019
Authors: Ioannis Z. Emiris, Elias P. Tsigaridas 
Publication date: 11 March 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.10.010
Recommendations
- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
- Complexity of real root isolation using continued fractions
- Complexity of real root isolation using continued fractions
- Continued fraction expansion of real roots of polynomial systems
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Cites Work
- Efficient isolation of polynomial's real roots.
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Numerical computation of polynomial zeros by means of Aberth's method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms in real algebraic geometry
- Title not available (Why is that?)
- An implementation of Vincent's theorem
- New bounds for the Descartes method
- Almost tight recursion tree bounds for the Descartes method
- Title not available (Why is that?)
- Amortized bound for root isolation via Sturm sequences
- Title not available (Why is that?)
- Solving a Polynomial Equation: Some History and Recent Progress
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- On distribution of zeros of random polynomials in complex plane
- On roots of random polynomials
- Optimal search for rationals
- Bounds for absolute positiveness of multivariate polynomials
- A new proof of Vincent's theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
- Implementations of a new theorem for computing bounds for positive roots of polynomials
- The zeros of random polynomials cluster uniformly near the unit circle
- On the distance between the roots of a polynomial
- Title not available (Why is that?)
- On the Problem of Runs
- Complexity of real root isolation using continued fractions
- A comparative study of two real root isolation methods
- Continued fraction expansions of algebraic numbers
- Bounds for positive roots of polynomials
- Upperbounds for roots of polynomials
- On the Khintchine constant
- Title not available (Why is that?)
- Algorithms – ESA 2004
- The largest digit in the continued fraction expansion of a rational number
- A Continued Fraction Algorithm for Real Algebraic Numbers
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Continued Fraction Algorithm for Approximating All Real Polynomial Roots
Cited In (28)
- A deterministic algorithm for isolating real roots of a real polynomial
- A general approach to isolating roots of a bitstream polynomial
- Logcf: an efficient tool for real root isolation
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions
- A quadratic clipping step with superquadratic convergence for bivariate polynomial systems
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
- On the computing time of the continued fractions method
- Continued fraction expansion of real roots of polynomial systems
- Improving root separation bounds
- Complexity of real root isolation using continued fractions
- Estimations of positive roots of polynomials
- Amortized bound for root isolation via Sturm sequences
- Univariate real root isolation over a single logarithmic extension of real algebraic numbers
- Computing real roots of real polynomials
- Real algebraic numbers and polynomial systems of small degree
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm
- On the complexity of the Descartes method when using approximate arithmetic
- Univariate real root isolation in an extension field and applications
- Complexity of real root isolation using continued fractions
- Continued fraction real root isolation using the Hong root bound
- Tree breadth of the continued fractions root finding method
- The continuous functions techniques for isolating the roots of integer polynomials
- On the maximum computing time of the bisection method for real root isolation
- Improved bounds for the CF algorithm
- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
- Separation bounds for polynomial systems
Uses Software
This page was built for publication: On the complexity of real root isolation using continued fractions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476019)
