Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Optimal multiplication chains for computing a power of a symbolic polynomial
HTML articles powered by AMS MathViewer

by W. Morven Gentleman PDF
Math. Comp. 26 (1972), 935-939 Request permission

Abstract:

This paper shows that in a certain model of symbolic manipulation of algebraic formulae, the simple method of computing a power of a symbolic polynomial by repeated multiplication by the original polynomial is, in essence, the optimal method.
References
    W. M. Gentleman & G. Sande, “Fast Fourier transforms—for fun and profit,” Proceedings of the 1966 Fall Joint Computer Conference, AFIPS, Spartan Books, Washington, 1966, pp. 563-578.
  • Donald E. Knuth, The art of computer programming, 2nd ed., Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, 1975. Volume 1: Fundamental algorithms. MR 0378456
Similar Articles
  • Retrieve articles in Mathematics of Computation with MSC: 68A15
  • Retrieve articles in all journals with MSC: 68A15
Additional Information
  • © Copyright 1972 American Mathematical Society
  • Journal: Math. Comp. 26 (1972), 935-939
  • MSC: Primary 68A15
  • DOI: https://doi.org/10.1090/S0025-5718-1972-0314303-3
  • MathSciNet review: 0314303