Bibliographic Details
| Title: |
PM, A System for Polynomial Manipulation. |
| Authors: |
Collins, G. E.1 |
| Source: |
Communications of the ACM. Aug1966, Vol. 9 Issue 8, p578-589. 12p. 1 Diagram. |
| Subjects: |
Algorithms, IBM computers, Computer software, Polynomials, Mathematical variables, Sorting (Electronic computers) |
| Abstract: |
PM is an IBM 7094 program system far formal manipulation of polynomials in any number of variables, with Integral coefficients unrestricted in size. Some of the formal operations which can be performed by the system are sums, differences, products, quotients, derivatives, substitutions and greatest common divisors. PM is based on the REECO 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 chokes of canonical forms for polynomials. A new algorithm for polynomial greatest common divisor calculation is mentioned, and examples are included to illustrate its superiority. [ABSTRACT FROM AUTHOR] |
|
Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Engineering Source |
