On the complexity of real root isolation using continued fractions
From MaRDI portal
Publication:2476019
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
Cites work
- scientific article; zbMATH DE number 3846864 (Why is no real title available?)
- scientific article; zbMATH DE number 5506212 (Why is no real title available?)
- scientific article; zbMATH DE number 3959523 (Why is no real title available?)
- scientific article; zbMATH DE number 42630 (Why is no real title available?)
- scientific article; zbMATH DE number 52304 (Why is no real title available?)
- scientific article; zbMATH DE number 3581610 (Why is no real title available?)
- scientific article; zbMATH DE number 1253962 (Why is no real title available?)
- scientific article; zbMATH DE number 1296286 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1113823 (Why is no real title available?)
- scientific article; zbMATH DE number 784876 (Why is no real title available?)
- scientific article; zbMATH DE number 1446863 (Why is no real title available?)
- scientific article; zbMATH DE number 3191380 (Why is no real title available?)
- A Continued Fraction Algorithm for Approximating All Real Polynomial Roots
- A Continued Fraction Algorithm for Real Algebraic Numbers
- A comparative study of two real root isolation methods
- A new proof of Vincent's theorem
- Algorithms in real algebraic geometry
- Algorithms – ESA 2004
- Almost tight recursion tree bounds for the Descartes method
- Amortized bound for root isolation via Sturm sequences
- An implementation of Vincent's theorem
- Bounds for absolute positiveness of multivariate polynomials
- Bounds for positive roots of polynomials
- Complexity of real root isolation using continued fractions
- Continued fraction expansions of algebraic numbers
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Efficient isolation of polynomial's real roots.
- Implementations of a new theorem for computing bounds for positive roots of polynomials
- New bounds for the Descartes method
- Numerical computation of polynomial zeros by means of Aberth's method
- On distribution of zeros of random polynomials in complex plane
- On roots of random polynomials
- On the Khintchine constant
- On the Problem of Runs
- On the distance between the roots of a polynomial
- Optimal search for rationals
- Solving a Polynomial Equation: Some History and Recent Progress
- The largest digit in the continued fraction expansion of a rational number
- The zeros of random polynomials cluster uniformly near the unit circle
- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Upperbounds for roots of polynomials
Cited in
(28)- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
- Separation bounds for polynomial systems
- 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
- Computing real roots of real polynomials
- Univariate real root isolation over a single logarithmic extension of real algebraic numbers
- 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
- Continued fraction real root isolation using the Hong root bound
- Complexity of real root isolation using continued fractions
- The continuous functions techniques for isolating the roots of integer polynomials
- Tree breadth of the continued fractions root finding method
- On the maximum computing time of the bisection method for real root isolation
- Improved bounds for the CF algorithm
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)
