Skip Navigation

The Computer Journal 1977 20(2):178-180; doi:10.1093/comjnl/20.2.178
© 1977 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Varol, Y. L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

On the generation of the pseudo-remainder in polynomial division

Y. L. Varol *

University of the Witwatersrand, Johannesburg, South Africa

All the known methods for finding the GCD-greatest common divisor – of two polynomials are based on some variation of Euclid's algorithm, which uses repeated division of the successive divisors by the remainders. Two new algorithms for generating the remainder resulting from the pseudo-division of polynomials over a commutative ring are suggested. They are compared with respect to memory and CPU requirements. It is found that the new algorithms are more efficient, in particular, when the difference between the degrees of the polynomials is large, and/or the commutative ring is not that of the integers.

Received July 1975.

* Now at: University of the Witwatersrand, Johannesburg.

§ Department of Mathematcis, Ben Gurion University of the Negev, PO Box 2053, Beersheva 84 120,Israel


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.