Almost tight recursion tree bounds for the descartes method

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn 2006, Issue , 2006, Pages 71-78

  Eigenwillig, Arno ^a   Sharma, Vikram ^b   Yap, Chee K ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b NEW YORK UNIVERSITY   (United States)

Author keywords

Bernstein basis; Davenport Mahler bound; Descartes method; Descartes rule of signs; Polynomial real root isolation

Indexed keywords

COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; NUMERICAL METHODS; POLYNOMIALS; PROBLEM SOLVING; RECURSIVE FUNCTIONS;

BERNSTEIN BASIS; DAVENPORT MAHLER BOUND; DESCARTES METHOD; POLYNOMIAL REAL ROOT ISOLATION; REAL POLYNOMIALS;

TREES (MATHEMATICS);

EID: 33748959696     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1145768.1145786     Document Type: Conference Paper

References (29)

1. S. Basu, R. Pollack, and M.-F. Roy. Algorithms in Real Algebraic Geometry. Springer, 2003.
2. P. Batra. Abschätzungen und Iterationsverfahren für Polynom-Nullstellen. PhD thesis, Technical University Hamburg-Harburg, 1999.
3. G. E. Collins and A. G. Akritas. Polynomial real root isolation using Descartes' rule of signs. In R. D. Jenks, editor, Proceedings of the 1976 ACM Symposium on Symbolic and Algebraic Computation, pages 272-275. ACM Press, 1976.
4. G. E. Collins and J. R. Johnson. Quantifier elimination and the sign variation method for real root isolation. In Proc. ACM-SIGSAM Symposium on Symbolic and Algebraic Computation, pages 264-271, 1989.
5. J. H. Davenport. Computer algebra for cylindrical algebraic decomposition. Tech. Rep., Royal Inst. of Technology, Dept. of Numer. Analysis and Computing Science, Stockholm, Sweden, 1985.
6. Reprinted as Tech. Rep. 88-10, U. of Bath, School of Math. Sciences, Bath, England, http://www.bath.ac.uk/~masjhd/TRITA.pdf.
7. Z. Du, V. Sharma, and C. K. Yap. Amortized bound for root isolation via Sturm sequences. In D. Wang and L. Zhi, editors, Proc. Internat. Workshop on Symbolic-Numeric Computation, pages 81-93, 2005. Int'l Workshop on Symbolic-Numeric Computation, Xi'an, China, Jul 19-21, 2005.
8. I. Z. Emiris, B. Mourrain, and E. P. Tsigaridas. Real algebraic numbers: Complexity analysis and experimentations. Research Report 5897, INRIA, April 2006. http://www.inria.fr/rrrt/rr-5897.html.
9. C. G. J. Jacobi. Observatiunculae ad theoriam aequationum pertinentes. Journal für die reine und angewandte Mathematik, 13:340-352, 1835. Available from http://gdz.sub.uni-goettingen.de.
10. J. R. Johnson. Algorithms for polynomial real root isolation. In B. F. Caviness and J. R. Johnson, editors, Quantifier Elimination and Cylindrical Algebraic Decomposition, pages 269-299. Springer, 1998.
11. J. R. Johnson, W. Krandick, and A. D. Ruslanov. Architecture-aware classical Taylor shift by 1. In Proc. 2005 International Symposium on Symbolic and Algebraic Computation (ISSAC 2005), pages 200-207. ACM, 2005.
12. W. Krandick. Isolierung reeller Nullstellen von Polynomen. In J. Herzberger, editor, Wissenschaftliches Rechnen, pages 105-154. Akademie-Verlag, Berlin, 1995.
13. W. Krandick and K. Mehlhorn. New bounds for the Descartes method. J. Symbolic Computation, 41(1):49-66, 2006.
14. J. M. Lane and R. F. Riesenfeld. Bounds on a polynomial. BIT, 21:112-117, 1981.
15. T. Lickteig and M.-F. Roy. Sylvester-Habicht sequences and fast Cauchy index computation. J.Symbolic Computation, 31:315-341, 2001.
16. K. Mahler. An inequality for the discriminant of a polynomial. Michigan Mathematical Journal, 11:257-262, 1964.
17. M. Mignotte. Some inequalities about univariate polynomials. In Proc. 1981 ACM Symposium on Symbolic and Algebraic Computation (SYMSAC 1981), pages 195-199. ACM, 1981.
18. M. Mignotte. On the distance between the roots of a polynomial. Applicable Algebra in Engineering, Commun., and Comput., 6:327-332, 1995.
19. M. Mignotte and D. Ştefãnescu. Polynomials: An Algorithmic Approach. Springer, Singapore, 1999.
20. B. Mourrain, F. Rouillier, and M.-F. Roy. The Bernstein basis and real root isolation. In J. E. Goodman, J. Pach, and E. Welzl, editors, Combinatorial and Computational Geometry, number 52 in MSRI Publications, pages 459-478. Cambridge University Press, 2005.
21. B. Mourrain, M. N. Vrahatis, and J. C. Yakoubsohn. On the complexity of isolating real roots and computing with certainty the topological degree. J. Complexity, 18:612-640, 2002.
22. A. M. Ostrowski. Note on Vincent's theorem. Annals of Mathematics, 2nd Ser., 52:702-707, 1950.
23. Reprinted in: A. Ostrowski, Collected Mathematical Papers, vol. 1, 728-733, Birkhäuser, 1983.
24. H. Prautzsch, W. Boehm, and M. Paluszny. Bézier and B-Spline Techniques. Springer, 2002.
25. D. Reischert. Asymptotically fast computation of subresultants. In ISSAC 97, pages 233-240, 1997. Maui, Hawaii.
26. F. Rouillier and P. Zimmermann. Efficient isolation of a polynomial['s] real roots. Rapport de Recherche 4113, INRIA, 2001. http://www.inria.fr/rrrt/rr- 4113.html.
27. F. Rouillier and P. Zimmermann. Efficient isolation of [a] polynomial's real roots. J. Computational and Applied Mathematics, 162:33-50, 2004.
28. J. von zur Gathen and J. Gerhard. Fast algorithms for Taylor shifts and certain difference equations. In Proc. 1997 International Symposium on Symbolic and Algebraic Computation (ISSAC 1997), pages 40-47. ACM, 1997.
29. C. K. Yap. Fundamental Problems of Algorithmic Algebra. Oxford University Press, 2000.