Isolating real roots of real polynomials

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

Volumn , Issue , 2009, Pages 247-254

  Mehlhorn, Kurt ^a   Sagraloff, Michael ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Bisection algorithm; Bitstream coefficient; Descartes' rule of sign; Real polynomial; Root isolation

Indexed keywords

ARBITRARY PRECISION; ASYMPTOTIC COMPLEXITY; BISECTION ALGORITHMS; BIT STREAM; DESCARTES; EXACT COMPUTATIONS; MULTIPLE ROOTS; POLYNOMIAL ROOTS; RANDOMIZED ALGORITHMS; REAL COEFFICIENTS; REAL ROOTS; ROOT ISOLATION;

POLYNOMIALS;

ALGORITHMS;

EID: 77950395142     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1576702.1576737     Document Type: Conference Paper

References (30)

1. O. Aberth. Precise Numerical Analysis. William C. Brown Company Publishers, Dubuque, IA, USA, 1988.
2. A. Akritas and A. Strzebonski. A comparative study of two root isolation methods. Nonlinear Analysis: Modelling and Control, 10:297-304, 2005.
3. A. G. Akritas. The fastest exact algorithms for the isolation of the real roots of a polynomial equation. Computing, 24(4):299-313, 1980.
4. S. Basu, R. Pollack, and M.-F. Roy. Algorithms in Real and Algebraic Geometry. Springer, 2nd edition, 2006.
5. E. Berberich, M. Kerber, and M. Sagraloff. Exact geometric-topological analysis of algebraic surfaces. In SoCG, pages 164-173, 2008.
6. D. Bini and G. Fiorentino. Design, analysis and implementation of a multiprecision polynomial rootfinder. Numerical Algorithms, 23:127-173, 2000.
7. CGAL (Computational Geometry Algorithms Library). www.cgal.org.
8. G. Collins, J. Johnson, and W. Krandick. Interval arithmetic in cylindrical algebraic decomposition. J. Symbolic Computation, 34:143-155, 2002.
9. G. E. Collins and A. G. Akritas. Polynomial real root isolation using Descartes' rule of signs. In SYMSAC, pages 272-275, 1976.
10. A. Eigenwillig. Real Root Isolation for Exact and Approximate Polynomials Using Descartes' Rule of Signs. PhD thesis, Saarland University, 2008.
11. A. Eigenwillig, M. Kerber, and N. Wolpert. Fast and exact analysis of real algebraic plane curves. In ISSAC, pages 151-158, 2007.
12. A. Eigenwillig, L. Kettner, W. Krandick, K. Mehlhorn, S. Schmitt, and N. Wolpert. An Exact Descartes Algorithm with Approximate Coefficients (Extended Abstract). In CASC, volume 3718 of LNCS, pages 138-149, 2005.
13. A. Eigenwillig, V. Sharma, and C. Yap. Almost tight complexity bounds for the Descartes method. In ISSAC, pages 151-158, 2006.
14. J. Gerhard. Modular algorithms in symbolic summation and symbolic integration. LNCS, Springer, 3218, 2004.
15. J. R. Johnson and W. Krandick. Polynomial real root isolation using approximate arithmetic. In W. Küchlin, editor, ISSAC, pages 225-232. ACM Press, 1997.
16. J. R. Johnson, W. Krandick, and A. D. Ruslanov. Architecture-aware classical taylor shift by 1. In ISSAC, pages 200-207, 2005.
17. M. Kerber. Analysis of real algebraic plane curves. Master's thesis, Saarland University, 2006. Master's thesis.
18. B. Mourrain, F. Rouillier, and M.-F. Roy. Bernstein's basis and real root isolation. Technical report, INRIA, 2004.
19. N. Obrechkoff. Zeros of Polynomials. Marina Drinov, Sofia, 2003. Translation of the Bulgarian original.
20. N. Obreschkoff. Verteilung und Berechnung der Nullstellen reeller Polynome. VEB Deutscher Verlag der Wissenschaften, 1963.
21. V. Pan. Solving a polynomial equation: Some history and recent progress. SIAM Review, 39:187-220, 1997.
22. V. Pan. Univariate polynomials: Nearly optimal algorithms for numerical factorization and root finding. J. Symbolic Computation, 33:701-733, 2002.
23. F. Roullier and P. Zimmermann. Efficient isolation of a polynomial's real roots. J. Computational and Applied Mathematics, pages 33-50, 2004.
24. I. J. Schoenberg. Zur Abzählung der reellen Wurzeln algebraischer Gleichungen. Mathematische Zeitschrift, pages 546-564, 1934.
25. A. Schönhage. The fundamental theorem of algebra in terms of computational complexity. www.informatik. uni-bonn.de/~schoe/fdmthmrep.ps.gz, 1982.
26. A. Schönhage. Quasi-GCD computations. Journal of Complexity, 1(1):118-137, 1985.
27. V. Sharma. Complexity of real root isolation using continued fractions. Theoretical Computer Science, 409:292-310, 2008.
28. E. Tsigaridas and I. Emiris. On the complexity of real root isolation using continued fractions. Theor. Comput. Sci., pages 158-173, 2008.
29. A. J. H. Vincent. Sur la résolution des equations numériques. Journal de Mathématiques Pures et Appliquées, 1:341-372, 1836.
30. C. Yap. Fundamental Problems in Algorithmic Algebra. Oxford University Press, 1999.