Complexity of real root isolation using continued fractions
From MaRDI portal
Recommendations
Cites work
- A new proof of Vincent's theorem
- Algorithms in real algebraic geometry
- Almost tight recursion tree bounds for the Descartes method
- Bounds for absolute positiveness of multivariate polynomials
- Bounds for positive roots of polynomials
- Complexity of real root isolation using continued fractions
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- scientific article; zbMATH DE number 3750284 (Why is no real title available?)
- scientific article; zbMATH DE number 42630 (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 1446863 (Why is no real title available?)
- scientific article; zbMATH DE number 3191380 (Why is no real title available?)
- Implementations of a new theorem for computing bounds for positive roots of polynomials
- Improving the performance of the continued fractions method using new bounds of positive roots
- Iteration Methods for Finding all Zeros of a Polynomial Simultaneously
- New bounds for the Descartes method
- Note on Vincent's theorem
- On the complexity of real root isolation using continued fractions
- On the Problem of Runs
- Polynomial Minimum Root Separation
- Rational approximations to algebraic numbers
- Real Algebraic Numbers: Complexity Analysis and Experimentation
- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
Cited in
(22)- A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration
- Logcf: an efficient tool for real root isolation
- On the complexity of the Descartes method when using approximate arithmetic
- Estimations of positive roots of polynomials
- On the complexity of real root isolation using continued fractions
- A symbolic-numerical algorithm for isolating real roots of certain radical expressions
- A Lower Bound for Computing Lagrange’s Real Root Bound
- On the Complexity of Reliable Root Approximation
- Improved bounds for the CF algorithm
- scientific article; zbMATH DE number 1113823 (Why is no real title available?)
- On the computing time of the continued fractions method
- Computing real roots of real polynomials
- Continued fraction real root isolation using the Hong root bound
- Complexity of real root isolation using continued fractions
- On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers
- Adaptive isotopic approximation of nonsingular curves: The parameterizability and nonlocal isotopy approach
- Univariate Polynomial Real Root Isolation: Continued Fractions Revisited
- A deterministic algorithm for isolating real roots of a real polynomial
- A general approach to isolating roots of a bitstream polynomial
- SqFreeEVAL: An (almost) optimal real-root isolation algorithm
- A quadratic clipping step with superquadratic convergence for bivariate polynomial systems
- Faster algorithms for computing Hong's bound on absolute positiveness
This page was built for publication: 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 Q2378508)
