STURM SEQUENCES AND MODIFIED SUBRESULTANT POLYNOMIAL REMAINDER SEQUENCES
暂无分享,去创建一个
[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 .