Univariate polynomial real root isolation: Continued fractions revisited

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4168 LNCS, Issue , 2006, Pages 817-828

  Tsigaridas, Elias P ^a   Emiris, Ioannis Z ^a  

^a UNIVERSITY OF ATHENS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; NUMBER THEORY;

ALGEBRAIC LIBRARY; MULTIPLICITIES; REAL ROOT ISOLATION; SQUARE-FREE POLYNOMIALS;

POLYNOMIALS;

EID: 33750734361     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_72     Document Type: Conference Paper

References (34)

1. A. Akritas. An implementation of Vincent's theorem. Numerische Mathematik, 36:53-62, 1980.
2. A. Akritas. There is no "Uspensky's method". Extended Abstract. In Proc. Symp. on Symbolic and Algebraic Computation, pp. 88-90, Waterloo, Canada, 1986.
3. A. Akritas, A. Bocharov, and A. Strzébonski. Implementation of real root isolation algorithms in Mathematica. Abstracts of Interval'94, pp. 23-27, Russia, 1994.
4. A. Akritas and A. Strzebonski. A comparative study of two real root isolation methods. Nonlinear Analysis: Modelling and Control, 10(4):297-304, 2005.
5. A.G. Akritas. Elements of Computer Algebra with Applications. J. Wiley & Sons, New York, 1989.
6. D. Bini and G. Fiorentino. Design, analysis, and implementation of a multiprecision polynomial rootfinder. Numerical Algorithms, pp. 127-173, 2000.
7. E. Bombieri and A. van der Poorten. Continued fractions of algebraic numbers. In Computational algebra and number theory, pp. 137-152. Kluwer, Dordrecht, 1995.
8. R. Brent, A. van der Poorten, and H. Riele. A comparative study of algorithms for computing continued fractions of algebraic numbers. In Henri Cohen, editor, ANTS, volume 1122 of LNCS, pp. 35-47. Springer, 1996.
9. G. Collins and A. Akritas. Polynomial real root isolation using Descartes' rule of signs. In SYMSAC '76, pp. 272-275, New York, USA, 1976. ACM Press.
10. G.E. Collins and R. Loos. Real zeros of polynomials. In B. Buchberger, G.E. Collins, and R. Loos, editors, Computer Algebra: Symbolic and Algebraic Computation, pp. 83-94. Springer-Verlag, Wien, 2nd edition, 1982.
11. J. H. Davenport. Cylindrical algebraic decomposition. Technical Report 88-10, School of Mathematical Sciences, University of Bath, England, 1988.
12. Z. Du, V. Sharma, and C. K. Yap. Amortized bound for root isolation via Sturm sequences. In D. Wang and L. Zhi, editors, Int. Workshop on Symbolic Numeric Computing, pp. 81-93, School of Science, Beihang University, Beijing, China, 2005.
13. A. Eigenwillig, V. Sharma, and C. Yap. Almost tight complexity bounds for the Descartes method, (to appear in ISSAC 2006), 2006.
14. I. Emiris and E. P. Tsigaridas. Computations with one and two algebraic numbers. Technical report, ArXiv, Dec 2005.
15. I. Z. Emiris, B. Mourrain, and E. P. Tsigaridas. Real Algebraic Numbers: Complexity Analysis and Experimentation. RR 5897, INRIA, Apr 2006.
16. I.Z. Emiris, E.P. Tsigaridas, and G.M. Tzoumas. The predicates for the Voronoi diagram of ellipses. In Proc. 24th Annual ACM SoCG, pp. 227-236, 2006.
17. A. Khintchine. Continued Fractions. University of Chicago Press, Chicago, 1964.
18. J. Kioustelidis. Bounds for the positive roots of polynomials. Journal of Computational and Applied Mathematics, 16:241-244, 1986.
19. W. Krandick and K. Mehlhorn. New bounds for the Descartes method. JSC, 41(1):49-66, Jan 2006.
20. M. Mignotte. Mathematics for computer algebra. Springer-Verlag, New York, 1991.
21. M. Mignotte and D. Stefanescu. Polynomials. Springer, 1999.
22. M. Mignotte. On the Distance Between the Roots of a Polynomial. Appl. Algebra Eng. Commun. Comput., 6(6):327-332, 1995.
23. B. Mourrain, J. P. Pavone, P. Trébuchet, and E. Tsigaridas. SYNAPS, a library for symbolic-numeric computation. In 8th MEGA, Italy, 2005. Software presentation.
24. V. Pan. Solving a polynomial equation: Some history and recent progress. SIAM Rev., 39(2): 187-220, 1997.
25. R. Richtmyer, M. Devaney, and N. Metropolis. Continued fraction expansions of algebraic numbers. Numerische Mathematik, 4:68-64, 1962.
26. D. Rosen and J. Shallit. A continued fraction algorithm for approximating all real polynomial roots. Math. Mag, 51:112-116, 1978.
27. F. Rouillier and Z. Zimmermann. Efficient isolation of polynomial's real roots. J. of Computational and Applied Mathematics, 162(1):33-50, 2004.
28. D. Stefanescu. New bounds for the positive roots of polynomials. Journal of Universal Computer Science, 11(12):2132-2141, 2005.
29. J. V. Uspensky. Theory of Equations. McGraw-Hill, 1948.
30. A. van der Poorten. An introduction to continued fractions. In Diophantine analysis, pp. 99-138. Cambridge University Press, 1986.
31. A. van der Sluis. Upper bounds for the roots of polynomials. Numerische Mathematik, 15:250-262, 1970.
32. A. J. H. Vincent. Sur la résolution des équations numériques. J. Math. Pures Appl., 1:341-372, 1836.
33. J. von zur Gathen and J. Gerhard. Fast Algorithms for Taylor Shifts and Certain Difference Equations. In ISSAC, pp. 40-47, 1997.
34. C.K. Yap. Fundamental Problems of Algorithmic Algebra. Oxford University Press, New York, 2000.