Sylvester-Habicht Sequences and Fast Cauchy Index Computation

Journal of Symbolic Computation

Volumn 31, Issue 3, 2001, Pages 315-341

  Lickteig, Thomas ^a   Roy, Marie Françoise ^b  

^a UNIVERSITY OF LIMOGES   (France)

^b UNIVERSITÉ DE RENNES 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000605515     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2000.0427     Document Type: Article

References (35)

1. Brent R. P., Gustavson F. G., Yun D. Y. Y. Fast solution of toeplitz systems of equations and computation of Padé approximants. J. Algorithms. 1:1980;259-295.
2. Brown W. S. On Euclid's algorithm and the computation of polynomial greatest common divisor. J. A. C. M. 18:1971;476-504.
3. Brown W. S., Traub J. F. On Euclid's algorithm and the theory of sub-resultants. J. A. C. M. 18:1971;505-524.
4. Collins G. E. Subresultants and reduced polynomial remainder sequence. J. A. C. M. 14:1967;128-142.
5. Ducos L. Algorithme de Bareiss, algorithmes des sous-résultants. Informatique théorique et applications. 30:1996;319-347.
6. Frobenius F. G. Über das Trägheitsgesetz der quadratischen Formen. 1884;. p. 241-256.
7. Gantmacher F. R. Théorie des matrices, tome I. 1966;Dunod 1966 and New York, Springer-Verlag 1986.
8. Gemigniani L. Computing the inertia of Bézout and Hankel matrices. Calcolo. 28:1991;267-274.
9. Gemigniani L. Solving Hankel systems over the integers. J. Symb. Comput. 18:1994;573-584.
10. Gonzalez L., Lombardi H., Recio T., Roy M.-F. Spécialisation de la suite de Sturm et sous-résultants I. Informatique théorique et applications. 24:1990;561-588.
11. Gonzalez L., Lombardi H., Recio T., Roy M.-F. Spécialisation de la suite Sturm. Informatique théorique et applications. 28:1994;1-24.
12. Gonzalez L., Lombardi H., Recio T., Roy M.-F. Sturm-Habicht sequence, determinants and real roots of univariate polynomials. Caviness B., Johnson J. Quantifier Elimination and Cylindrical Algebraic Decomposition. 1998;Springer-Verlag, New York.
13. Habicht W. Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens. Comm. Math. Helvetici. 21:1948;99-116.
14. Henrici P. Upper bounds for the abscissa of stability of a stable polynomial. SIAM J. Num. Anal. 7:1970;538-544.
15. Henrici P. Applied and Computational Complex Analysis. 1974;J. Wiley, New York.
16. Ho C.-H., Yap C. K. Pseudo-subresultants. J. Symb. Comput. 21:1996;1-14.
17. Knebusch M., Scheiderer C. Einführung in die reelle Algebra. 1989;Aufbaukurs Mathematik, Vieweg.
18. Krein M. G., Naimark M. A. The method of symmetric and hermitian forms in the theory of separation of roots of algebraic equation. Kharkov 1936 (in Russian). English translation. Linear and Multi-linear Algebra (1981). 10:1936;265-308.
19. Kung H. T. On computing reciprocals of power series. Numer. Math. 22:1974;341-348.
20. D. Lazard.
21. Lickteig T., Roy M.-F. Cauchy index computation. Calcolo. 33:1996;337-351.
22. Loos R. Generalized polynomial remainder sequences. Computer Algebra, Symbolic and Algebraic Computation. 1982;Springer-Verlag, Berlin.
23. Moenck R. T. Fast computation of GCDs. Proceedings STOC '73. 1973;142-151.
24. C. Quitté
25. D. Reischert, 1997, ACM Press, 233, 240.
26. Roy M.-F. Basic algorithms in real algebraic geometry and their complexity: from Sturm's theorem to the existential theory of reals. Lectures on Real Geometry in Memoriam of Mario Raimondo. 1996.
27. Schönhage A. Schnelle Berechnung von Kettenbruchentwicklungen. Acta Informatica. 1:1971;139-144.
28. A. Schönhage, Proceedings, EUROCAM '82, 1982, Marseille.
29. Schönhage A., Strassen V. Schnelle Multiplikation großer Zahlen. Computing. 7:1971;281-292.
30. Sieveking M. An algorithm for division of power series. Computing. 10:1972;153-156.
31. Strassen V. The computational complexity of continued fractions. SIAM J. Comp. 12/1:1983;1-27.
32. Sturm C. Mémoire sur la résolution des équations numériques. Inst. France Sc. Math. Phys. 6:1835.
33. Sylvester J. J. On a theory of syzygetic relations of two rational integral functions, comprising an application to the theory of Sturm's function. Trans. Roy. Soc. London. 1835.
34. K. Thull, C. K. Yap.
35. Yap C. K. Fundamental Problems in Algorithmic Algebra. 1999;Oxford University Press, Oxford.