A Descartes Algorithm for Polynomials with Bit-Stream Coefficients

@inproceedings{Eigenwillig2005ADA,
  title={A Descartes Algorithm for Polynomials with Bit-Stream Coefficients},
  author={Arno Eigenwillig and Lutz Kettner and Werner Krandick and Kurt Mehlhorn and Susanne Schmitt and Nicola Wolpert},
  booktitle={CASC},
  year={2005}
}
The Descartes method is an algorithm for isolating the real r oots of square-free polynomials with real coefficients. We assume t hat coefficients are given as (potentially infinite) bit-streams. In other words , coefficients can be approximated to any desired accuracy, but are not known exactl y. We show that a variant of the Descartes algorithm can cope with bit-stream coefficients. To isolate the real roots of a square-free real polynomial q(x) = qnx + . . .+ q0 with root separation… CONTINUE READING
Highly Cited
This paper has 98 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.
62 Citations
19 References
Similar Papers

Citations

Publications citing this paper.

99 Citations

0102030'07'10'13'16
Citations per Year
Semantic Scholar estimates that this publication has 99 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Efficient isolation of a po lynomial’s real roots

  • F. Rouillier, P. Zimmermann
  • J. Computational and Applied Mathematics
  • 2004
Highly Influential
5 Excerpts

Algorithms in Real Algeb raic Geometry

  • S. Basu, R. Pollack, M. F. Roy
  • Springer
  • 2003

Bézier and B-Sp line Techniques

  • H. Prautzsch, W. Boehm, M. Paluszny
  • Springer
  • 2002
1 Excerpt

Similar Papers

Loading similar papers…