An elementary approach to subresultants theory

Journal of Symbolic Computation

Volumn 35, Issue 3, 2003, Pages 281-292

  El Kahoui, M'hammed ^a  

^a FACULTÉ DES SCIENCES SEMLALIA   (Morocco)

Author keywords

Polynomial determinant; Subresultant sequence

Indexed keywords

EID: 0037339296     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(02)00135-9     Document Type: Review

References (22)

1. Brown, W.S., Traub, J.F., 1971. On Euclid's algorithm and the theory of subresultants. J. ACM 18 (4), 505-514.
2. Chardin, M., 1991. Differential resultants and resultants, Lecture Notes in Computer Science, vol. 529, pp. 180-189.
3. Cheng, C.C., 2001. A chain rule for subresultants. J. Pure Appl. Algebra 157 (1), 33-39.
4. Cohen, A.M., Cuypers, H., Sterk, H., 1999. Some Tapas of Computer Algebra, Algorithms and Computations in Mathematics, vol. 4, Springer-Verlag, Heidelberg.
5. Collins, G.E., 1967. Subresultants and reduced polynomial remainder sequences. J. ACM 14, 128-142.
6. Ducos, L., 2000. Optimization of the subresultant algorithm. J. Pure Appl. Abgebra 145, 149-163.
7. von zur Gathen, J., Gerhard, J., 1999. Modern Computer Algebra, Cambridge University Press, Cambridge.
8. von zur Gathen, J., Luking, T., 2000. Subresultants revisited. Proceedings of Latin 2000: Theoretical Informatics, Punta del Este, Uruguay, Springer Lecture Notes in Computer Science, vol. 1776. Heidelberg, pp. 318-342.
9. González-Vega, L., Lombardi, H., Recio, T., Roy, M.-F., 1990. Spécialisation de la suite de Sturm et sous-résultants, RAIRO Inform. Théor. Appl. 24 (6), 561-588.
10. González-Vega, L., Lombardi, H., Recio, T., Roy, M.-F., 1994. Spécialisation de la suite de Sturm. RAIRO Inform. Théor. Appl. 28 (1), 1-24.
11. Habicht, W., 1948. Eine verallgemeinerung des sturmschen wurzelzahlverfahrens. Commun. Math. Halvetici 21, 99-116.
12. Ho, C.J., Yap, C.K., 1996. The Habicht approach to subresultants. J. Symb. Comput. 21 (1), 1-14.
13. Hong, H., 1997. Subresultants under composition. J. Symb. Comput. 23 (4), 355-365.
14. Hong, H., 1999. Subresultants in Roots (preprint).
15. Lickteig, T., Roy, M.-F., 1996a. Cauchy index computation. Calcolo 33, 337-351.
16. Lickteig, T., Roy, M.-F., 1996b. Semi-algebraic complexity of quotients and sign determination of remainders. Special issue for the Foundations of Computational Mathematics Conference, Rio de Janeiro, 1997. J. Complexity 12 (4), 545-571.
17. Lickteig, T., Roy, M.-F., 2001. Sylvester-Habicht sequences and fast Cauchy index computation. J. Symb. Comput. 31 (3), 315-341.
18. Lombardi, H., Roy, M.-F., Safey El Din, M., 2000. New structure theorem for subresultants. J. Symb. Comput. 29, 663-690.
19. Loos, R., 1982. Generalized polynomial remainder sequences. In: Computer Algebra Symbolic and Algebraic Computation, Springer-Verlag, pp. 115-138.
20. Reischert, D., 1997. Asymptotically fast computation of subresultants. In: Proceedings of ISSAC' 97 (Kihei, Hi), ACM, New York, pp. 233-240.
21. Sturm, C., 1835. Mémoire sur la résolution des équations numériques. Inst. France Sc. Math. Phys. Vol. VI, pp. 273-318.
22. Tarski, A., 1951. A Decision Method for Elementary Algebra and Geometry, second edn, University of California Press, Berkeley.