Complexity of real root isolation using continued fractions

Theoretical Computer Science

Volumn 409, Issue 2, 2008, Pages 292-310

  Sharma, Vikram ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Continued fractions; Davenport Mahler bound; Polynomial real root isolation; The Descartes' rule of signs

Indexed keywords

CONTINUED FRACTION ALGORITHMS; CONTINUED FRACTIONS; DAVENPORT-MAHLER BOUND; LOGARITHMIC FACTORS; POLYNOMIAL BOUNDS; REAL ROOT ISOLATIONS; THE DESCARTES' RULE OF SIGNS; WORST CASES;

POLYNOMIAL APPROXIMATION;

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

References (36)

1. Aberth O. Iteration methods for finding all zeros of a polynomial simultaneously. Mathematics and Computation 27 (1973) 339-344
2. A. Akritas, A new look at one of the Bisection Methods derived from Vincent's theorem or There is no Descartes' method. http://inf-server.inf.uth.gr/~akritas/articles/71.pdf
3. A. Akritas, A. Bocharov, A. Strzeboński, Implementation of real root isolation algorithms in Mathematica, in: Abstracts of the International Conference on Interval and Computer-Algebraic Methods in Science and Engineering, Interval'94, St. Petersburg, Russia, March 7-10 1994, pp. 23-27
4. A.G. Akritas, Vincent's theorem in algebraic manipulation, Ph.D. Thesis, Operations Research Program, North Carolina State University, Raleigh, NC, 1978
5. Akritas A.G. Elements of Computer Algebra with Applications (1989), John Wiley Interscience, New York
6. Akritas A.G., Strzeboński A., and Vigklas P. Improving the performance of the continued fractions method using new bounds of positive roots. Nonlinear Analysis: Modelling and Control 13 3 (2008) 265-279
7. Akritas A.G., Strzeboński A., and Vigklas P. Implementations of a new theorem for computing bounds for positive roots of polynomials. Computing 78 (2006) 355-367 Published online
8. Alesina A., and Galuzzi M. A new proof of Vincent's theorem. L'Enseignement Mathémathique 44 (1998) 219-256
9. Basu S., Pollack R., and Roy M.-F. Algorithms in Real Algebraic Geometry. 2nd edition (2006), Springer
10. Bini D.A., and Fiorentino G. Design, analysis, and implementation of a multiprecision polynomial rootfinder. Numerical Algorithms 23 (2000) 127-173. http://www.dm.unipi.it/cluster-pages/mpsolve/index.htm Package available at: http://www.dm.unipi.it/cluster-pages/mpsolve/index.htm
11. Collins G.E., and Akritas A.G. Polynomial real root isolation using Descartes' rule of signs. In: Jenks R.D. (Ed). Proc. of the 1976 ACM Symp. on Symbolic and Algebraic Computation (1976), ACM Press 272-275
12. J.H. Davenport, Computer algebra for cylindrical algebraic decomposition, Technical Report, The Royal Institute of Technology, Department of Numerical Analysis and Computing Science, S-100 44, Stockholm, Sweden, 1985. Reprinted as: Tech. Rep. 88-10, School of Math. Sciences, U. of Bath, Bath, England. http://www.bath.ac.uk/~masjhd/TRITA.pdf
13. Z. Du, V. Sharma, C. Yap, Amortized bounds for root isolation via Sturm sequences, in: D. Wang and L. Zhi (Eds.), Proc. Int'l Workshop on Symbolic-Numeric Computation, School of Science, Beihang University, Beijing, China, 2005, pp. 81-93
14. A. Eigenwillig, Real root isolation for exact and approximate polynomials using Descartes' rule of signs, Ph.D. Thesis, Universität des Saarlandes, Saarbrücken, Germany, 2008
15. A. Eigenwillig, V. Sharma, C. Yap, Almost tight complexity bounds for the Descartes method, in: Proc. 2006 Int'l Symp. Symbolic and Algebraic Computation, ISSAC'06, Genova, Italy, 2006
16. Emiris I.Z., Mourrain B., and Tsigaridas E.P. Real algebraic numbers: Complexity analysis and experimentation. In: Hertling P., Hoffmann C.M., Luther W., and Revol N. (Eds). Reliable Implementation of Real Number Algorithms: Theory and Practice. Lecture Notes in Computer Science vol. 5045 (2006), Springer. http://www.inria.fr/rrrt/rr-5897.html Available as Research Report 5897, INRIA. http://www.inria.fr/rrrt/rr-5897.html
17. Hong H. Bounds for absolute positiveness of multivariate polynomials. Journal of Symbolic Computation 25 5 (1998) 571-585
18. Khinchin A.Ya. Continued Fractions (1997), Dover Publications
19. Kioustelidis J. Bounds for the positive roots of the polynomials. Journal of Computational and Applied Mathematics 16 (1986) 241-244
20. Krandick W. Isolierung reeller Nullstellen von Polynomen. In: Herzberger J. (Ed). Wissenschaftliches Rechnen (1995), Akademie-Verlag, Berlin 105-154
21. Krandick W., and Mehlhorn K. New bounds for the Descartes method. Journal of Symbolic Computation 41 1 (2006) 49-66
22. Mignotte M. Some inequalities about univariate polynomials. Proc. 1981 ACM Symp. on Symbolic and Algebraic Computation. SYMSAC 1981 (1981), ACM 195-199
23. Mignotte M., and Ştefǎnescu D. Polynomials: An Algorithmic Approach (1999), Springer, Singapore
24. Obreschkoff N. Über die Wurzeln von algebraischen Gleichhungen. Jahresbericht der Deutschen Mathematiker-Vereinigung 33 (1925) 52-64
25. Ostrowski A. Note on Vincent's theorem. The Annals of Mathematics 52 3 (1950) 702-707
26. Roth K. Rational approximations to algebraic numbers. Mathematika 2 (1955) 160-167
27. Rump S.M. Polynomial minimum root separation. Math. Comp. 33 (1979) 327-336
28. V. Sharma, Complexity analysis of algorithms in algebraic computation, Ph.D. Thesis, Dept. of Computer Science, NYU, January 2007
29. Sharma V. Complexity of real root isolation using continued fractions. In: Brown C. (Ed). Proc. International Symposium on Symbolic and Algebraic Computation (2007), ACM 339-346
30. Ştefǎnescu D. New bounds for the positive roots of polynomials. Journal of Universal Computer Science 11 12 (2005) 2132-2141
31. Tsigaridas E.P., and Emiris I.Z. Univariate polynomial real root isolation: Continued fractions revisited. In: Azar Y., and Erlebach T. (Eds). Proc. 13th European Symp. on Algorithms. ESA. LNCS vol. 4168 (2006), Springer 817-828
32. Tsigaridas E.P., and Emiris I.Z. On the complexity of real root isolation using continued fractions. Theoretical Computer Science 392 1-3 (2008) 158-173
33. Uspensky J.V. Theory of Equations (1948), McGraw-Hill, New York
34. Vincent A. Sur la résolution des équations numériques. Journal of Mathematics Pures Applications 1 (1836) 341-372
35. von zur Gathen J., and Gerhard J. Fast algorithms for Taylor shifts and certain difference equations. Proc. 1997 Int'l Symp. on Symbolic and Algebraic Computation. ISSAC 1997 (1997), ACM 40-47
36. Yap C.K. Fundamental Problems of Algorithmic Algebra (2000), Oxford University Press