|
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.
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
|
|
| |
2
|
--. REFCO I I I , a reference count list processing system for the IBM 7094. IBM Res. Rept. RC-1436, May, 1965.
|
| |
3
|
MCCARTHY, J., ET AL. LISP I programmer's manual. Computation Center and Res. Lab. of Electronics, MIT, Cambridge, Mass., 1960.
|
 |
4
|
|
| |
5
|
GLASNER, JUDITH, ET AL. The NU-SPEAK system. NYO- 1480-9, Courant Inst. of Mathematical Sciences, New York University, New York, N.Y., Nov. 1964.
|
 |
6
|
|
 |
7
|
|
| |
8
|
BROWN, W.S. The ALPAK system for non-numerical algebra on a digital computer--I: Polynomials in several variables and truncated power series with polynomial coefficients. Bell Sys. Tech. J. 42 (Sept. 1963), 2081-2119.
|
| |
9
|
--, HYDE, J. P., AND TAGUE, B. A. The ALPAK system for non-numerical algebra on a digital computer-II: Rational functions of several variables and truncated power series with rational function coefficients. Bell Sys. Tech. J. 48 (March 1964), 785-804.
|
| |
10
|
HYDE, J. P. The ALPAK system for non-numerical algebra on a digital computer--III: systems of linear equations and a class of side relations. Bell Sys. Tech. J., 43, (July, 1964), 1547-1562.
|
| |
11
|
TARSKI, A. A Decision Method for Elementary Algebra and Geometry. U. of California Press, Berkeley, Calif., 2nd ed.
|
| |
12
|
COLLINS, G. E. Polynomial remainder sequences and determinants. IBM Res. Rept. RC-1209, June, 1964. Also Am. Math. Month. to be published.
|
| |
13
|
--. Subresultants and reduced polynomial remainder sequences. Notices of the Am. Math. Soc., to appear.
|
| |
14
|
USPENSKY, J. V., AND HEASLET, M. A. Elementary Number Theory. McGraw Hill Co., New York, N. Y., 1939, pp. 43-45.
|
CITED BY 21
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Stephen M. Watt , Peter A. Broadbery , Samuel S. Dooley , Pietro Iglio , Scott C. Morrison , Jonathan M. Steinbach , Robert S. Sutor, A first report on the A# compiler, Proceedings of the international symposium on Symbolic and algebraic computation, p.25-31, July 20-22, 1994, Oxford, United Kingdom
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|