Abstract
Methods are presented for taking powers of symbolic polynomials and substituting them into univariate polynomials with scalar coefficients. It is shown that the size of the result is a sharp lower bound on the number of coefficient multiplications required to raise a completely sparse polynomial to a power. Other theoretical results prove the optimality or near-optimality of the methods given, in terms of numbers of coefficient operations, under the condition of complete sparsity of the argument.
Publisher
Association for Computing Machinery (ACM)
Reference6 articles.
1. (AL 77) Alagar Vangalur A. and Probst D.: "Binomial-expansion algorithms for computing integer powers of sparse polynomials " International Computing Symposium 1977 E. Morlet and D. Ribbins eds. North Holland Amsterdam (1977) pp. 395--402. (AL 77) Alagar Vangalur A. and Probst D.: "Binomial-expansion algorithms for computing integer powers of sparse polynomials " International Computing Symposium 1977 E. Morlet and D. Ribbins eds. North Holland Amsterdam (1977) pp. 395--402.
2. Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments
3. On the Computation of Powers of Sparse Polynomials
4. Optimal multiplication chains for computing a power of a symbolic polynomial
5. Practical fast polynomial multiplication
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Sparse Polynomial Powering Using Heaps;Computer Algebra in Scientific Computing;2012