On continued fraction expansion of real roots of polynomial systems, complexity and condition numbers

Theoretical Computer Science

Volumn 412, Issue 22, 2011, Pages 2312-2330

  Mantzaflaris, Angelos ^a   Mourrain, Bernard ^a   Tsigaridas, Elias ^a,b  

^a INRIA   (France)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Continued fraction; Homography; Monomial basis; Real root isolation; Subdivision solver

Indexed keywords

CONTINUED FRACTION; HOMOGRAPHIES; MONOMIAL BASIS; REAL ROOT ISOLATION; SUBDIVISION SOLVER;

FUNCTIONS; MULTIVARIABLE SYSTEMS; NUMBER THEORY; POLYNOMIALS;

ALGORITHMS;

EID: 79953296412     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2011.01.009     Document Type: Article

References (33)

1. A. Alesina, and M. Galuzzi A new proof of Vincent's theorem L'Enseignement Mathmatique 44 1998 219 256
2. M. Barto, and B. Jttler Computing roots of polynomials by quadratic clipping Comput. Aided Geom. Design 24 2007 125 141
3. Lenore Blum, Felipe Cucker, Mike Shub, and Steve Smale Complexity and real computation: A manifesto Internat. J. Bifur. Chaos Appl. Sci. Engrg. 6 1 1996 3 26
4. E. Bombieri, and A. van der Poorten Continued fractions of algebraic numbers Computational algebra and number theory (Sydney, 1992) 1995 Kluwer Acad. Publ Dordrecht 137 152
5. Guillaume Chze, Jean-Claude Yakoubsohn, Andr Galligo, and Bernard Mourrain Computing nearest gcd with certification Symbolic-Numeric Computation (SNC'09) Japon Kyoto, 2009-08-27 2009 ACM 29 34 New York, NY, USA
6. Felipe Cucker, Teresa Krick, Gregorio Malajovich, and Mario Wschebor A numerical algorithm for zero counting, I: Complexity and accuracy J. Complexity 24 56 2008 582 605
7. Felipe Cucker, Teresa Krick, Gregorio Malajovich, and Mario Wschebor A numerical algorithm for zero counting, II: Distance to ill-posedness and smoothed analysis J. Fixed Point Theory Appl. 6 2 2009 285 294
8. J.P. Dedieu, and J.C. Yakoubsohn Computing the real roots of a polynomial by the exclusion algorithm Numer. Algorithms 4 1 1993 1 24
9. Arno Eigenwillig, Vikram Sharma, and Chee K. Yap Almost tight recursion tree bounds for the Descartes method ISSAC 2006 2006 ACM New York 71 78 (Pubitemid 44438953)
10. G. Elber, and M.-S Kim Geometric constraint solver using multivariate rational spline functions Proc. of 6th ACM Symposium on Solid Modelling and Applications 2001 ACM Press 1 10 (Pubitemid 32865667)
11. I.Z. Emiris, B. Mourrain, and E.P. Tsigaridas Real algebraic numbers: Complexity analysis and experimentation P. Hertling, C. Hoffmann, W. Luther, N. Revol, Reliable Implementations of Real Number Algorithms: Theory and Practice LNCS vol. 5045 2008 Springer Verlag 57 82
12. Ioannis Z. Emiris, Bernard Mourrain, and Elias P. Tsigaridas The DMM bound: Multivariate (aggregate) separation bounds S. Watt, Proc. 35th ACM Int'l Symp. on Symbolic & Algebraic Comp., ISSAC 2010 Munich Germany 243 250
13. Jrgen Garloff, and Andrew P. Smith Investigation of a subdivision based algorithm for solving systems of polynomial equations J. Nonlinear Anal. 47 1 2001 167 178 (Pubitemid 32707159)
14. Michael Hemmer, Elias P. Tsigaridas, Zafeirakis Zafeirakopoulos, Ioannis Z. Emiris, Menelaos I. Karavelas, and Bernard Mourrain Experimental evaluation and cross-benchmarking of univariate real solvers Proc. 3rd ACM Int'l Work. Symbolic Numeric Computation, SNC 2009 ACM New York, NY, USA 45 54
15. A. Khintchine Continued Fractions 1964 University of Chicago Press Chicago
16. P. Lvy Sur les lois de probabiliti dont dependent les quotients complets et incomplets d' une fraction continue Bull. Soc. Math. 57 1929 178 194
17. Angelos Mantzaflaris, Bernard Mourrain, and Elias Tsigaridas Continued fraction expansion of real roots of polynomial systems Proc. 3rd ACM Int'l Work. Symbolic Numeric Computation, SNC 2009 ACM New York, NY, USA 85 94
18. M. Marden Geometry of Polynomials 1966 American Mathematical Society Providence, RI
19. K. Mehlhorn, and S. Ray Faster algorithms for computing Hong's bound on absolute positiveness J. Symbolic Comput. 45 6 2010 677 683
20. B. Mourrain, and J.P. Pavone Subdivision methods for solving polynomial equations J. Symbolic Comput. 44 3 2009 292 306 Polynomial System Solving in honor of Daniel Lazard
21. B. Mourrain, F. Rouillier, and M.-F. Roy Bernstein's basis and real root isolation 2005 Mathematical Sciences Research Institute Publications. Cambridge University Press 459 478
22. V.Y. Pan Solving a polynomial equation: Some history and recent progress SIAM Rev. 39 2 1997 187 220 (Pubitemid 127654704)
23. V.Y. Pan Univariate polynomials: Nearly optimal algorithms for numerical factorization and rootfinding J. Symbolic Comput. 33 5 2002 701 733
24. V. Sharma Complexity of real root isolation using continued fractions Theoret. Comput. Sci. 409 2 2008 292 310
25. E.C. Sherbrooke, and N.M. Patrikalakis Computation of the solutions of nonlinear polynomial systems Comput. Aided Geom. Design 10 5 1993 379 405
26. Michael Shub, and Steve Smale Complexity of Bezout's theorem i: Geometric aspects J. Amer. Math. Soc. 6 2 1993 459 501
27. E.P. Tsigaridas, and I.Z. Emiris On the complexity of real root isolation using Continued Fractions Theoret. Comput. Sci. 392 2008 158 173
28. A. van der Poorten An introduction to continued fractions Diophantine analysis 1986 Cambridge University Press 99 138
29. J. von zur Gathen, and J. Gerhard Fast algorithms for Taylor shifts and certain difference equations Proc. Annual ACM ISSAC 1997 40 47
30. Michael N. Vrahatis A short proof and a generalization of Miranda's existence theorem Proc. Amer. Math. Soc. 107 3 1989 701 703
31. J.C. Yakoubsohn Approximating the zeros of analytic functions by the exclusion algorithm Numer. Algorithms 6 1 1994 63 88
32. C.K. Yap Fundamental Problems of Algorithmic Algebra 2000 Oxford University Press New York
33. Y. Yomdin, and G. Comte Tame geometry with applications in smooth analysis LNM 1834 2004 Springer-Verlag