Efficient isolation of polynomial's real roots

Journal of Computational and Applied Mathematics

Volumn 162, Issue 1, 2004, Pages 33-50

  Rouillier, Fabrice ^a   Zimmermann, Paul ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b LORIA   (France)

Author keywords

Computer algebra; Real root; Univariate polynomial

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; NUMERICAL METHODS; OPTIMIZATION;

GENERIC ALGORITHMS; MEMORY USAGE;

POLYNOMIALS;

ALGORITHM; MATHEMATICAL ANALYSIS;

EID: 0347385177     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cam.2003.08.015     Document Type: Article

References (22)

1. Akritas A.G. An implementation of Vincent's Theorem Numer. Math. 36 1980 53-62
2. A.G. Akritas, There is no "Uspensky's method", in: Proceedings of the 1986 SYMSAC, ACM, 1986, New York, pp. 88-90.
3. A.G. Akritas, A. Bocharov, A. Strzebonski, Implementation of real roots isolation algorithms in Mathematica, in: Abstracts of the International Conference on Interval and Computer Algebraic Methods in Science and Engineering, 1994, pp. 23-27.
4. D. Bini, G. Fiorentino, Numerical computation of polynomial roots: Mpsolve-version 2.0. http://www.dm.unipi.it/pages/bini/public_html/papers/mps2.html
5. G. Collins, A. Akritas, Polynomial real roots isolation using Descartes' rule of signs, in: SYMSAC, 1976, pp. 272-275.
6. G. Collins, J. Johnson, Quantifier elimination and the sign variation method for real roots isolation, in: ACM-SYGSAM ISSAC, 1989, pp. 264-271.
7. G.E. Collins, J. Johnson, W. Krandick, Interval arithmetic in cylindrical algebraic decomposition, J. Symbolic Comput. 34 (2002) 145-157.
8. S. Fortune, An iterated eigenvalue algorithm for approximating roots of univariate polynomials, 2000, 23p. http://cm.bell-labs.com/who/sjf/ieaarup.ps.gz
9. S. Fortune, Polynomial root finding using iterated eigenvalue computation, in: B. Mourrain (Ed.), Proceedings of ISSAC'01, University of Western Ontario, Ontario Research Centre for Computer Algebra, ACM Press, 2001, pp. 121-128.
10. J.V.Z. Gathen, J. Gerhard, Fast algorithms for Taylor shifts and certain difference equations, in: Proceedings of International Symposium On Symbolic and Algebraic Computations, 1997, pp. 40-47.
11. GMP.http://www.swox.com/gmp
12. G. Hanrot, F. Rouillier, P. Zimmermann, Well-defined semantics for floating-point computations: The MPFR library, 2000, ISSAC'2000 and MuPAD Workshop 2000 poster sessions, abstract available at http://www.mupad.de/mw2000/anno/abstracts_p/index_e.shtml
13. J. Johnson, Algorithms for polynomial real root isolation, Technical Report OSU-CISRC-8/91-TR21, Ohio State University, Department of Computer and Information Science, 1991.
14. J. Johnson, W. Krandick, Polynomial real roots isolation using approximate arithmetic, in: W. Küchlin (Ed.), Proceedings of International Symposium On Symbolic and Algebraic Computations, ACM Press, New York, 1997.
15. Krandick W. Isolierung reeller Nullstellen von Polynomen Herzberger J. Wissenschaftliches Rechnen 1995 105-154 Akademie Verlag Berlin
16. W. Krandick, A data structure for approximation, Technical Report MS 96-021, University of Edinburgh, Department of Mathematics and Statistics, 1996.
17. W. Krandick, Trees and jumps and real roots, J. Comput. Appl. Math. 162 (2004) 51-55.
18. K. Mehlhorn, Private communication, October 2001, 6pp.
19. MPFI.http://www.ens-lyon.fr/~nrevol/nr_software.html
20. MPFR.http://www.loria.fr/projets/mpfr/
21. Uspensky J. Theory of Equations 1948 McGraw-Hill Book Company New York
22. A.J.H. Vincent, Sur la résolution des équations numériques, J. Math. Pures Appl. Ser. 1, 1 (1836) 341-372.