Real algebraic numbers: Complexity analysis and experimentation

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

Volumn 5045 LNCS, Issue , 2008, Pages 57-82

  Emiris, Ioannis Z ^a   Mourrain, Bernard ^b   Tsigaridas, Elias P ^a  

^a UNIVERSITY OF ATHENS   (Greece)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC COMPLEXITY; BIT SIZE; INTEGER COEFFICIENTS; REAL NUMBERS;

CHLORINE COMPOUNDS; NUMBER THEORY;

ASYMPTOTIC ANALYSIS;

EID: 51049115312     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85521-7_4     Document Type: Conference Paper

References (51)

1. Akritas, A.: An implementation of Vincent's theorem. Numerische Mathematik 36, 53-62 (1980)
2. Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Algorithms and Computation in Mathematics, vol. 10. Springer, Heidelberg (2003)
3. Ben-Or, M., Kozen, D., Reif, J.H.: The complexity of elementary algebra and geometry. J. Comput. Syst. Sci. 32, 251 264 (1986)
4. Berberich, E., Eigenwillig, A., Hemmer, M., Hert, S., Kettner, L., Mehlhorn, K., Reichel, J., Schmitt, S., Schömer, E., Wolpert, N.: EXACUS: Efficient and Exact Algorithms for Curves and Surfaces. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 155-166. Springer, Heidelberg (2005)
5. Bini, D.: Numerical computation of polynomial zeros by means of Aberth's method. Numerical Algorithms 13(3 4), 179 200 (1996)
6. Bini, D., Fiorentino, G.: Design, analysis, and implementation of a multiprecision polynomial rootfinder. Numerical Algorithms, 127-173 (2000)
7. Canny, J.: Improved algorithms for sign determination and existential quantifier elimination. The Computer Journal 36(5), 409-418 (1993)
8. Cazals, F., Faugère, J.-C., Pouget, M., Rouillier, F.: The implicit structure of ridges of a smooth parametric surface. Technical Report 5608, INRIA (2005)
9. Collins, G.: Subresultants and reduced polynomial remainder sequences. J. ACM 14, 128 142 (1967)
10. Collins, G., Akritas, A.: Polynomial real root isolation using Descartes' rule of signs. In: SYMSAC 1976, pp. 272-275. ACM Press, New York (1976)
11. Collins, G., Loos, R.: Real zeros of polynomials. In: Buchberger, B., Collins, G., Loos, R. (eds.) Computer Algebra: Symbolic and Algebraic Computation, 2nd edn., pp. 83-94, Springer, Wien (1982)
12. Coste, M., Roy, M.F.: Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets. J. Symb. Comput. 5(1/2), 121-129 (1988)
13. Davenport, J.H.: Cylindrical algebraic decomposition. Technical Report 88-10, School of Mathematical Sciences, University of Bath, England (1988), http://www.bath.ac.uk/masjhd/
14. Du, Z., Sharma, V., Yap, C.K.: Amortized bound for root isolation via Sturm sequences. In: Wang, D., Zhi, L. (eds.) Int. Workshop on Symbolic Numeric Computing, School of Science, Beihang University, Beijing, China, pp. 81-93 (2005)
15. Eigenwillig, A., Kettner, L., Krandick, W., Mehlhorn, K., Schmitt, S., Wolpert, N.: A Descartes Algorithm for Polynomials with Bit-Stream Coefficients. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds.) CASC 2005. LNCS, vol. 3718, pp. 138 149. Springer, Heidelberg (2005)
16. Eigenwillig, A., Sharma, V., Yap, C.K.: Almost tight recursion tree bounds for the Descartes method. In: ISSAC 2006: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, pp. 71-78. ACM Press, New York (2006)
17. El Kahoui, M.: An elementary approach to subresultants theory. J. Symb. Comput. 35(3), 281-292 (2003)
18. Emiris, I., Kakargias, A., Teillaud, M., Tsigaridas, E., Pion, S.: Towards an open curved kernel. In: Proc. Annual ACM Symp. on Computational Geometry, pp. 438-446. ACM Press, New York (2004)
19. Emiris, I., Tsigaridas, E.: Computing with real algebraic numbers of small degree. In: Albers, S., Radzik, T. (eds.) ESA 2004, LNCS, vol. 3221, pp. 652-663. Springer, Heidelberg (2004)
20. Emiris, I., Tsigaridas, E.: Real solving of bivariate polynomial systems. In: Ganzha, V., Mayr, E., Vorozhtsov, E. (eds.) Proc. Computer Algebra in Scientific Computing (CASC), pp. 150-161. Springer, Heidelberg (2005)
21. Emiris, L, Tsigaridas, E., Tzoumas, G.: The predicates for the Voronoi diagram of ellipses. In: Proc. 22th Annual ACM Symp. on Computational Geometry, Sedona, USA, pp. 227-236 (2006)
22. Emiris, I., Tsigaridas, E.P.: Computations with one and two algebraic numbers. Technical report, ArXiv (Dec 2005)
23. Geddes, K., Czapor, S., Labahn, G.: Algorithms of Computer Algebra. Kluwer Academic Publishers, Boston (1992)
24. González-Vega, L., Lombardi, H., Recio, T., Roy, M.-F.: Sturm-Habicht Sequence. In: ISSAC, pp. 136-146 (1989)
25. Guibas, L., Karavelas, M., Russel, D.: A computational framework for handling motion, In: Proc. 6th Workshop Algor. Engin. & Experim. (ALENEX), January 2004, pp. 129-141 (2004)
26. Heindel, L.E.: Integer arithmetic algorithms for polynomial real zero determination. Journal of the Association for Computing Machinery 18(4), 533-548 (1971)
27. Johnson, J.: Algorithms for polynomial real root isolation. In: Caviness, B., Johnson, J. (eds.) Quantifier elimination and cylindrical algebraic decomposition, pp. 269-299. Springer, Heidelberg (1998)
28. Karamcheti, V., Li, C., Pechtchanski, I., Yap, C.: A CORE library for robust numeric and geometric computation. In: 15th ACM Symp. on Computational Geometry (1999)
29. Krandick, W.: Isolierung reeller Nullstellen von Polynomen, In: Herzberger, J. (ed.) Wissenschaftliches Rechnen, pp. 105-154. Akademie-Verlag, Berlin (1995)
30. Krandick, W., Mehlhorn, K.: New bounds for the Descartes method. JSC 41(1), 49-66 (2006)
31. Lane, J.M., Riesenfeld, R.F.: Bounds on a polynomial. BIT 21, 112-117 (1981)
32. Lickteig, T., Roy, M.-F.: Sylvester-Habicht Sequences and Fast Cauchy Index Computation, J. Symb. Comput. 31(3), 315-341 (2001)
33. Lombardi, H., Roy, M.-F., Safey El Din, M.: New Structure Theorem for Subresultants. J. Symb. Comput. 29(4-5), 663 689 (2000)
34. Mignotte, M.: Mathematics for Computer Algebra. Springer, Heidelberg (1992)
35. Mignotte, M.: On the Distance Between the Roots of a Polynomial. Appl. Algebra Eng. Commun. Comput. 6(6), 327-332 (1995)
36. Mourrain, B., Pavone, J.P., Trébuchet, P., Tsigaridas, E.: SYNAPS, a library for symbolic-numeric computation, In: 8th Int. Symposium on Effective Methods in Algebraic Geometry, MEGA, Sardinia, Italy, May 2005. Software presentation (2005)
37. Mourrain, B., Rouillier, F., Roy, M.-F.: Bernstein's basis and real root isolation. Mathematical Sciences Research Institute Publications, pp. 459-478. Cambridge University Press, Cambridge (2005)
38. Mourrain, B., Técourt, J., Teillaud, M.: On the computation of an arrangement of quadrics in 3d. Comput. Geom. 30(2), 145-164 (2005)
39. Mourrain, B., Vrahatis, M., Yakoubsohn, J.: On the complexity of isolating real roots and computing with certainty the topological degree. J. Complexity 18(2) (2002)
40. Pan, V.: Univariate polynomials: Nearly optimal algorithms for numerical factorization and rootfincling. J. Symbolic Computation 33(5), 701-733 (2002)
41. Reischert, D.: Asymptotically fast computation of subresultants. In: ISSAC, pp. 233-240 (1997)
42. Rioboo, R.: Towards faster real algebraic numbers. In: Proc. ACM Intern. Symp. on Symbolic & Algebraic Comput, Lille, France, pp. 221-228 (2002)
43. Rouillier, F., Zimmermann, Z.: Efficient isolation of polynomial's real roots. J. of Computational and Applied Mathematics 162(1), 33-50 (2004)
44. Roy, M.-F., Szpirglas, A.: Complexity of the Computation on Real Algebraic Numbers. J. Symb. Comput. 10(1), 39 52 (1990)
45. Schönhage, A.: The fundamental theorem of algebra in terms of computational complexity. Univ. of Tübingen, Germany (manuscript, 1982)
46. Sharma, V., Yap, C.: Sharp Amortized Bounds for Descartes and de Casteljau's Methods for Real Root Isolation (October 2005) (unpublished manuscript)
47. Tsigaridas, E.P., Emiris, I.Z.: Univariate polynomial real root isolation: Continued fractions revisited. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 817-828. Springer, Heidelberg (2006)
48. von zur Gathen, J., Gerhard, J.: Fast Algorithms for Taylor Shifts and Certain Difference Equations. In: ISSAC, pp. 40-47 (1997)
49. von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn, Cambridge Univ. Press, Cambridge (2003)
50. von zur Gathen, J., Lucking, T.: Subresultants revisited. Theor. Comput. Sci. 1-3(297), 199-239 (2003)
51. Yap, C.: Fundamental Problems of Algorithmic Algebra. Oxford University Press, New York (2000)