Corpus ID: 10657635

On the Complexity of Real Root Isolation

@article{Sagraloff2010OnTC,
  title={On the Complexity of Real Root Isolation},
  author={Michael Sagraloff},
  journal={ArXiv},
  year={2010},
  volume={abs/1011.0344}
}
  • Michael Sagraloff
  • Published 2010
  • Computer Science, Mathematics
  • ArXiv
  • We introduce a new approach to isolate the real roots of a square-free polynomial $F=\sum_{i=0}^n A_i x^i$ with real coefficients. It is assumed that each coefficient of $F$ can be approximated to any specified error bound. The presented method is exact, complete and deterministic. Due to its similarities to the Descartes method, we also consider it practical and easy to implement. Compared to previous approaches, our new method achieves a significantly better bit complexity. It is further… CONTINUE READING
    Computing real roots of real polynomials
    • 54
    • Open Access
    On the complexity of solving a bivariate polynomial system
    • 31
    • Open Access
    Efficient real root approximation
    • 25
    • Open Access
    A worst-case bound for topology computation of algebraic curves
    • 33
    • Open Access
    On the complexity of the Descartes method when using approximate arithmetic
    • 13
    • Open Access
    SqFreeEVAL: An (almost) optimal real-root isolation algorithm
    • 24
    • Open Access
    From approximate factorization to root isolation
    • 11
    Root Refinement for Real Polynomials
    • 5
    • Open Access
    Univariate real root isolation in an extension field
    • 19
    • Highly Influenced
    • Open Access

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 54 REFERENCES
    On the complexity of real root isolation using continued fractions
    • 54
    • Open Access
    Efficient isolation of polynomial's real roots
    • 215
    • Open Access
    Polynomial real root isolation using Descarte's rule of signs
    • 218
    • Open Access
    Efficient real root approximation
    • 25
    • Open Access
    Almost tight recursion tree bounds for the Descartes method
    • 104
    • Open Access
    A worst-case bound for topology computation of algebraic curves
    • 33
    • Open Access
    A General Approach to Isolating Roots of a Bitstream Polynomial
    • 9
    • Open Access