Thumbnail
Access Restriction
Subscribed

Author Collins, G. E.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract PM is an IBM 7094 program system for formal manipulation of polynomials in any number of variables, with integral coefficients unrestricted in size. Some of the formal opeartions which can be performed by the system are sums, differences, products, quotients, derivatives, substitutions and greatest common divisors. PM is based on the REFCO III list processing system, which is described and compared with the LISP and SLIP systems. The PM subroutines for arithmetic of large integers are described as constituting an independently useful subsystem. PM is compared with the ALPAK system in several respects, including the choices of canonical forms for polynomials. A new algorithm for polynomial greatest common divisor calculation is mentioned, and examples are included to illustrate its superiority.
Description Affiliation: IBM Watson Research Center, Yorktown Heights, NY (Collins, G. E.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 9
Issue Number 8
Page Count 12
Starting Page 578
Ending Page 589


Open content in new tab

   Open content in new tab
Source: ACM Digital Library