STURM SEQUENCES AND MODIFIED SUBRESULTANT POLYNOMIAL REMAINDER SEQUENCES

In 1971 using pseudo-divisions - that is, by working in Z[x] - Brown and Traub computed Euclid’s polynomial remainder sequences (prs’s) and (proper) subresultant prs’s using sylvester1, the most widely known form of Sylvester’s matrix, whose determinant defines the resultant of two polynomials. In this paper we use, for the first time in the literature, the Pell-Gordon Theorem of 1917, and sylvester2, a little known form of Sylvester’s matrix of 1853 to initially compute Sturm sequences in Z[x] without pseudodivisions - that is, by working in Q[x]. We then extend our work in Q[x] and, despite the fact that the absolute value of the determinant of sylvester2 equals the absolute value of the resultant, we construct modified subresultant prs’s, which may differ from the proper ones only in sign.

[1]  A. Akritas,et al.  On a Theorem by Van Vleck Regarding Sturm Sequences , 2013 .

[2]  Joseph F. Traub,et al.  On Euclid's Algorithm and the Theory of Subresultants , 1971, JACM.

[3]  E CollinsGeorge.  Subresultants and Reduced Polynomial Remainder Sequences , 1967 .

[4]  Alkiviadis G. Akritas.  Exact Algorithms for the Matrix-Triangularization Subresultant PRS Method , 1989, Computers and Mathematics.

[5]  J. Sylvester,et al.  XVIII. On a theory of the syzygetic relations of two rational integral functions, comprising an application to the theory of Sturm’s functions, and that of the greatest algebraical common measure , 1853, Philosophical Transactions of the Royal Society of London.

[6]  A. Akritas.  Sylvester''s forgotten form of the resultant , 1993 .

[7]  W. S. Brown.  The Subresultant PRS Algorithm , 1978, TOMS.

[8]  George E. Collins.  Polynomial Remainder Sequences and Determinants , 1966 .

[9]  Alkiviadis G. Akritas,et al.  Elements of Computer Algebra with Applications , 1989 .

[11]  J. J. Sylvester,et al.  XXIII. A method of determining by mere inspection the derivatives from two equations of any degree , 1840 .

[12]  W. Habicht.  Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens , 1948 .

[13]  George E. Collins,et al.  Subresultants and Reduced Polynomial Remainder Sequences , 1967, JACM.

[14]  E. B. Van Vleck.  On the Determination of a Series of Sturm's Functions by the Calculation of a Single Determinant , 1899 .

[15]  Alkiviadis G. Akritas,et al.  A simple proof of the validity of the reduced prs algorithm , 1987, Computing.

[16]  Alkiviadis G. Akritas.  A new method for computing polynomial greates common divisors and polynomial remainder sequences , 1988 .