W. S. Brown
- 1 BROWN, W S On Euchd's algorithm and the computation of polynomial greatest common divisors J ACM 18, 4 (Oct. 1971), 478-504. Google Scholar
- 2 BROWN, W S, AND TRAUB, J.F. On Euclid's algorithm and the theory of subresultants. J. ACM 18, 4 (Oct. 1971), 505-514. Google Scholar
- 3 COLLINS, G E Comment on a paper by Ku and Alder. Comm. ACM 12, 6 (June 1969), 302-303. Google Scholar
- 4 COLLtNS, G E Subresultants and reduced polynomial remainder sequences J ACM 14, 1 (Jan. 1967), 128-142. Google Scholar
- 5 GENTLEMAN, W M, AND jOHNSON, S C Analysis of algorithms A case study' Determinants of matrices with polynomial entries ACM Trans Math Software 2, 3 (Sept 1976), 232-241. Google Scholar
- 6 GOLDSTEIN, A J, AND GRAHAM, R.L A Hadamard-type bound on the coefficmnts of a determinant of polynomials SIAM Rev 16 {July 1974), 394-395.Google Scholar
- 7 HEARN, A.C An unproved non-modular GCD algorithm. SIGSAM Bull. (ACM) 6 (July 1972), 10-15 Google Scholar
- 8 KNUTH, D E The Art of Computer Programmtng, Vol 2. Addison-Wesley, Reading, Mass 1969. Google Scholar
- 9 Ku, S Y, AND ADLER, R J Computing polynomial resultants Bezout's determinant vs. Collins' reduced PRS algorithm. Comm ACM 12, 1 (Jan. 1969), 23-30. Google Scholar
- 10 MOSES, J, AND YUN, D Y Y. The EZ GCD algorithm Proc ACM Nat. Conf., Aug 1973, pp. 159-166. Google Scholar
Index Terms
- The Subresultant PRS Algorithm
Recommendations
On the subresultant PRS algorithm
SYMSAC '76: Proceedings of the third ACM symposium on Symbolic and algebraic computationThis paper is a sequel to two earlier papers [1, 2] on the generalization of Euclid's algorithm to domains of polynomials.
In attempting such a generalization one easily arrives at the concept of a polynomial remainder sequence (PRS), and then quickly ...
Ruppert matrix as subresultant mapping
CASC'07: Proceedings of the 10th international conference on Computer Algebra in Scientific ComputingRuppert and Sylvester matrices are very common for computing irreducible factors of bivariate polynomials and computing polynomial greatest common divisors, respectively. Since Ruppert matrix comes from Ruppert criterion for bivariate polynomial ...
The Gröbner basis algorithm and subresultant theory
ISSAC '94: Proceedings of the international symposium on Symbolic and algebraic computationWe investigate the possibility of constructing for Gro¨bner bases a concept similar to the one provided by subresultants for polynomial remainder sequences. Namely, we try to express the Gro¨bner basis polynomials obtained during the algorithm in terms ...
Comments