A fast, low-space algorithm for multiplying dense multivariate polynomials

Author:

Alagar Vangalur S.1,Probst David K.1

Affiliation:

1. Concordia Univ., Montreal, Que., Canada

Abstract

This paper presents an improved adaptive hybrid algorithm for multiplying dense multivariate polynomials that is both time and space efficient. The hybrid algorithm makes use of two families of univariate algorithms, one Karatsuba based and the other DFT based, which are applied recursively to solve the multivariate problem. The hybrid algorithm is adaptive in that particular univariate algorithms are selected at run time to minimize the time complexity; an order-of-magnitude speedup with respect to classical multiplication is achieved over the entire practical range except for very small problems. Empirical investigation shows that most of the theoretical superiority is maintained in actual implementation. The largest contribution to the space requirements of the total algorithm is determined by the univariate algorithm used for the outermost variable; except for quite small problems, selecting univariate algorithms to minimize run time almost always leads to situations where the space requirements of the total algorithm are extremely close to the space required merely to store the result.

Publisher

Association for Computing Machinery (ACM)

Subject

Applied Mathematics,Software

Reference10 articles.

1. New algorithms for digital convolution

2. Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments

3. MCCLELLAN J. H. AND RADER C.M. Number Theory in Digital Signal Processing. Prentice Hall Englewood Cliffs N.J. 1979. (Contains reprints of {1} and {9}.) MCCLELLAN J. H. AND RADER C.M. Number Theory in Digital Signal Processing. Prentice Hall Englewood Cliffs N.J. 1979. (Contains reprints of {1} and {9}.)

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. On the bit-complexity of sparse polynomial and series multiplication;Journal of Symbolic Computation;2013-03

2. Counting Ancestral Reconstructions in a Fixed Phylogeny;Annals of Combinatorics;2008-04

3. Parallel multiplication and powering of polynomials;Journal of Symbolic Computation;1991-04

4. A Schur vector method to solve higher order Lyapunov equations;IEEE Transactions on Automatic Control;1990

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3