Corpus ID: 13954777

Computing Real Roots of Real Polynomials - An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration

@article{Sagraloff2013ComputingRR,
  title={Computing Real Roots of Real Polynomials - An Efficient Method Based on Descartes' Rule of Signs and Newton Iteration},
  author={Michael Sagraloff and K. Mehlhorn},
  journal={ArXiv},
  year={2013},
  volume={abs/1308.4088}
}
  • Michael Sagraloff, K. Mehlhorn
  • Published 2013
  • Mathematics, Computer Science
  • ArXiv
  • Computing the real roots of a polynomial is a fundamental problem of computational algebra. We describe a variant of the Descartes method that isolates the real roots of any real square-free polynomial given through coefficient oracles. A coefficient oracle provides arbitrarily good approximations of the coefficients. The bit complexity of the algorithm matches the complexity of the best algorithm known, and the algorithm is simpler than this algorithm. The algorithm derives its speed from the… CONTINUE READING
    Quadratic interval refinement for real roots
    27
    Nearly optimal refinement of real roots of a univariate polynomial
    23
    Near Optimal Subdivision Algorithms for Real Root Isolation
    7
    Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane
    8
    On the complexity of computing with planar algebraic curves
    24
    A near-optimal algorithm for computing real roots of sparse polynomials
    13

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 40 REFERENCES
    When Newton meets Descartes: a simple and fast algorithm to isolate the real roots of a polynomial
    51
    Polynomial real root isolation using Descarte's rule of signs
    206
    Efficient Isolation of a Polynomial Real Roots
    77
    Efficient real root approximation
    25
    Root Refinement for Real Polynomials
    5
    SqFreeEVAL: An (almost) optimal real-root isolation algorithm
    24
    Quadratic interval refinement for real roots
    27
    A simple but exact and efficient algorithm for complex root isolation
    60
    Real root isolation for exact and approximate polynomials using Descartes' rule of signs
    59
    Polynomial real root isolation using approximate arithmetic
    39