The Subresultant PRS Algorithm

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The Subresultant PRS Algorithm

Full text

Pdf (710 KB)

Source

ACM Transactions on Mathematical Software (TOMS) archive
Volume 4 , Issue 3 (September 1978) table of contents

Pages: 237 - 249

Year of Publication: 1978

ISSN:0098-3500

Author

W. S. Brown

Bell Laboratories, 600 Mountain Ave., Murray Hill, NJ

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 20, Downloads (12 Months): 41, Citation Count: 7

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/355791.355795 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	W. S. Brown, On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors, Journal of the ACM (JACM), v.18 n.4, p.478-504, Oct. 1971 [doi>10.1145/321662.321664]
	2	W. S. Brown , J. F. Traub, On Euclid's Algorithm and the Theory of Subresultants, Journal of the ACM (JACM), v.18 n.4, p.505-514, Oct. 1971 [doi>10.1145/321662.321665]
	3	George E. Collins, Letters to the editor: comment on a paper by Ku and Adler, Communications of the ACM, v.12 n.6, p.302-303, June 1969 [doi>10.1145/363011.363017]
	4	George E. Collins, Subresultants and Reduced Polynomial Remainder Sequences, Journal of the ACM (JACM), v.14 n.1, p.128-142, Jan. 1967 [doi>10.1145/321371.321381]
	5	W. M. Gentleman , S. C. Johnson, Analysis of Algorithms, A Case Study: Determinants of Matrices with Polynomial Entries, ACM Transactions on Mathematical Software (TOMS), v.2 n.3, p.232-241, Sept. 1976 [doi>10.1145/355694.355696]
	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.
	7	Anthony C. Hearn, An improved non-modular polynomial GCD algorithm, ACM SIGSAM Bulletin [doi>10.1145/1093522.1093524]
	8	Donald E. Knuth, The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1997
	9	S. Y. Ku , R. J. Adler, Computing polynomial resultants: Bezout's determinant vs. Collins' reduced P.R.S. algorithm, Communications of the ACM, v.12 n.1, p.23-30, Jan. 1969 [doi>10.1145/362835.362839]
	10	Joel Moses , David Y. Y. Yun, The EZ GCD algorithm, Proceedings of the annual conference, p.159-166, August 27-29, 1973, Atlanta, Georgia, United States [doi>10.1145/800192.805698]

CITED BY 7

	D. Castro , L. M. Pardo , J. San Martín, Systems of rational polynomial equations have polynomial size approximate zeros on the average, Journal of Complexity, v.19 n.2, p.161-209, April 2003
	Lars Langemyr, An analysis of the subresultant algorithm over an algebraic number field, Proceedings of the 1991 international symposium on Symbolic and algebraic computation, p.167-172, July 15-17, 1991, Bonn, West Germany
	Paul S. Wang, A p-adic algorithm for univariate partial fractions, Proceedings of the fourth ACM symposium on Symbolic and algebraic computation, p.212-217, August 05-07, 1981, Snowbird, Utah, United States
	S. S. Abhyankar , C. J. Bajaj, Automatic parameterization of rational curves and surfaces IV: algebraic space curves, ACM Transactions on Graphics (TOG), v.8 n.4, p.325-334, Oct. 1989
	Joachim von zur Gathen , Thomas Lücking, Subresultants revisited, Theoretical Computer Science, v.297 n.1-3, p.199-239, 17 March 2003
	Paul S. Wang, The EEZ-GCD algorithm, ACM SIGSAM Bulletin, v.14 n.2, p.50-60, May 1980
	Arno Eigenwillig , Lutz Kettner , Elmar Schömer , Nicola Wolpert, Exact, efficient, and complete arrangement computation for cubic curves, Computational Geometry: Theory and Applications, v.35 n.1, p.36-73, August 2006