Abstract.
This article is devoted to presenting new expressions for Subresultant Polynomials, written in terms of some minors of matrices different from the Sylvester matrix. Moreover, via these expressions, we provide new proofs for formulas which associate the Subresultant polynomials and the roots of the two polynomials. By one hand, we present a new proof for the formula introduced by J. J. Sylvester in 1839, formula written in terms of a single sum over the roots. By other hand, we introduce a new expression in terms of the roots by considering the Newton basis.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Abdeljaoued, J., Diaz-Toca, G.M., Gonzalez-Vega, L.: Minor of Bezout matrices, Subresultants and parameterization of the degree of the polynomial greatest common divisor. Int. J. Comput. Math. 81, 10, 1223–1238 (2004)
Barnett, S.: Polynomials and Linear Control Systems. Marcel Dekker, 1983
Basu, S., Polack, R., Roy, M.F.: Algorithms in Real Algebraic Geometry. Algorithms and Computations in Mathematics 10, Springer-Verlag, 2003
Bini, D., Pan, V.: Polynomial and Matrix Computations. 1, Fundamental Algorithms, Birkhäuser, 1994
Brown, W.S., Traub, J.F.: On Euclid’s algorithm and the theory of subresultants. J. Asso. Comput. Machinery 118, 505–514 (1971)
Borchardt, C.W.: Über eine Interpolationsformel für eine Art symmetrischer Functionen und über deren Anwendung. Math. Abh. der Akademie der Wissenschaftern zu Berlin, 1860, pp. 1–20
Chistov, A.L.: Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic. Proc. FCT ‘85, Springer Lecture Notes in Computer Science 199, 147–150 (1985)
Collins, G.E.: Subresultants and reduced polynomial remainder sequences. J. Asso. Comput. Machinery 14, 128–142 (1967)
Diaz–Toca, G.M., Gonzalez–Vega, L.: Barnett’s Theorem about the greatest common divisor of several univariate polynomials through Bezout–like Matrices. J. Symbolic Comput. 34(1), 59–81 (2002)
Dixon, A.L.: The eliminant of three quantics in two independent variables. Proc. Lond. Math. Soc. 6(49–69) 473–192 (1908)
El Kahoui, M.: An elementary approach to subresultants theory. J. Symbolic Comput. 35, 281–292 (2003)
Gantmacher, F.R.: Theórie des matrices. Volumen I, Dunod, 1966
Von zur Gathen, J., Lücking, T.: Subresultants revisited. Theor. Comput. Sci. 297, 199–239 (2003)
Goldman, R.N., Zhang, M., Chionh, E.W.: Transformations and Transitions from the Sylvester to the Bezout Resultant. Rice Technical Report TR 99–343, Rice University, Estados Unidos, 1999
Gonzalez–Vega, L., Lombardi, H., Recio, T., Roy, M.-F.: Specialisation de la suite de Sturm et sous-resultants (I). Informatique Theorique et Appl. 24(6), 561–588 (1990)
Gonzalez-Vega, L.: An elementary proof of Barnett’s Theorem About the greatest common divisor of several univariate polynomials. Linear Algebra and Its Appl.247, 185–202 (1996)
Gonzalez-Vega, L.: A combinatorial algorithm solving some quantifier elimination problems. Quantifier elimination and cylindrical algebraic decomposition (Linz, 1993), Texts Monogr. Symbol. Comput. Springer, Vienna, 1998, pp. 365–375
Griss, M.L.: Using an efficient sparse minor expansion. Algorithm to compute polynomial subresultants and the greatest common denominator. IEEE Transactions on computers c-27(10), 945–949 (1978)
Helmke, U., Fuhrmann, P.A.: Bezoutians. Linear Algebra and Its Applications 122/123/124, 1039–1097 (1989)
Hong, H.: Subresultants under composition. J. Symbolic Comput. 23(4), 355–365 (1999)
Hong, H.: Subresultants in Roots. Preprint, 1999
Hong, H.: Subresultants in Roots Proceedings of 8th International Conference On Applications of Computer Algebra. (ACA’2002) Volos, Greece, 2002
Hou, S.H., Pang, W.K.: Inversion of Confluent Vandermonde Matrices. Comput. Math. Appl. 43, 1539–1547 (2002)
Lander, F.I.: Bezoutiante und Inversion Hankelscher und Toeplitzscher Matrizen. Matematicheskie Issledovaniia 9(32), 69–87 (1974)
Lascoux, A., Pragacz, P.: Double Sylvester Sums for Euclidean Division, Multi–Shur functions, and Gysin maps for Grassmann Bundles. J. Symbolic Comput. 35(6), 689–710 (2003)
Loos, R.: Generalized polynomial remainder sequences. Computer Algebra, Computing Suplementum Springer-Verlag, 4, 115–138 (1982)
Lombardi, H., Roy, M.-F., Safey, M.: New structure theorem for subresultants. J. Symbolic Comput. 29, 663–689 (2000)
Mignotte, M.: Mathematics for Computer Algebra. Springer-Verlag, 1992
Sylvester, J.J.: On rational derivation from equations of coexistence. Philosophical Magazine, XV, 428–435 (1839)
Sylvester, J.J.: On a Theory of Syzygetic relations of two rational integral functions, comprising an application to the theory of Sturm’s function and that of the greatest algebraical common measure. Trans. Roy. Soc. London, 1853
Wang, D.: Subresultants with the Bezout Matrix. Computer Mathematics. Proceedings of the Fourth Asian Symposium on Computer Mathematics (ASCM 2000), World Scientific, 2000, pp. 19–28
Zippel, R.: Effective Polynomial Computation. Kluwer Academic Publishers Group, 1952
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by the European Union funded project RAAG (HPRN–CT–2001–00271) and by the spanish grant BFM2002-04402-C02-0
Rights and permissions
About this article
Cite this article
Diaz–Toca, G., Gonzalez–Vega, L. Various New Expressions for Subresultants and Their Applications. AAECC 15, 233–266 (2004). https://doi.org/10.1007/s00200-004-0158-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-004-0158-4