New structure theorem for subresultants

Journal of Symbolic Computation

Volumn 29, Issue 4-5, 2000, Pages 663-690

  Lombardi, Henri ^a   Roy, Marie Françoise ^b   El Din, Mohab Safey ^c  

^a Supmicrotech ENSMM   (France)

^b UNIVERSITÉ DE RENNES 1   (France)

^c UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (11)

1. Brown W. S. On Euclid's algorithm and the computation of polynomial greatest common divisors. J. Assoc. Comput. Mach. 18:1971;478-504.
2. Brown W. S., Traub J. F. On Euclid's algorithm and the theory of subresultants. J. Assoc. Comput. Mach. 18:1971;505-514.
3. Collins G. E. Subresultants and reduced polynomial remainder sequences. J. Assoc. Comput. Mach. 14:1967;128-142.
4. Ducos L. Optimizations of the subresultant algorithm. J. Pure Appl. Algebra. 145:2000;149-163.
5. Gonzalez L., Lombardi H., Recio T., Roy M.-F. Spécialisation de la suite de Sturm et sous-résultants I. Inf. Théorique Appl. 24:1990;561-588.
6. González-Vega L., Rouillier F., Roy M.-F., Trujillo G. Symbolic recipes for real solutions. Cohen A. et al., Some Tapas of Computer Algebra, volume 4 of Algorithms and Computation in Mathematics. 1999;121-167 Springer.
7. Habicht W. Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens. Commun. Math. Helvetici. 21:1948;99-116.
8. D. Lazard, Unpublished.
9. Lickteig T., Roy M.-F. Cauchy index computation. Calcolo. 33:1996;337-351.
10. Loos R. Generalized polynomial remainder sequences. Computer Algebra, Symbolic and Algebraic Computation. 1982;Springer-Verlag, Berlin.
11. C. Quitté, Unpublished.