Affiliation:
1. Katholieke Universiteit Leuven, Heverlee, Belgium
Abstract
J. A. Campbell [1] has proposed the computation of his Y
2n
polynomials as a benchmark problem for algebraic manipulation systems. Eight solutions to problem #2 <u>(SIGSAM Bulletin</u> No. 22, March 1972) have been provided in <u>SIGSAM Bulletin</u> No. 24, October 1972. Here is a summary of a POLMAN [2,3] program which solves this problem. Using the POLMAN system installed on an IBM 370/155 at K.U.L., Computing Centre, these polynomials were computed through n = 8 in 16 sec., through n = 10 in 45 sec., through n = 12 in 2 min., 51 sec. The memory requirements for the POLMAN system together with the program (24,5 K bytes) and a workspace of approximately 34,5 K bytes occupied a total of 190 K bytes for the case of n = 10. The workspace has an overflow to a secondary store (disk) [2,3].
Publisher
Association for Computing Machinery (ACM)
Reference3 articles.
1. Problem #2 - the Y
2n
functions
2. P. Verbaeten Polynomial Manipulation (thesis) Applied Mathematics and Programming Division 1972 (Katholieke Universiteit Leuven). P. Verbaeten Polynomial Manipulation (thesis) Applied Mathematics and Programming Division 1972 (Katholieke Universiteit Leuven).
3. ALTRAN