计算截断乘积
Computing Clipped Products
AI总结:
本文研究乘积中指定跨度系数或数位的计算问题,推广中间乘积概念,并重点讨论经典乘法与Karatsuba乘法的组合方法以提升系统性能。
摘要:
有时只需要数值乘积的某些数位,或多项式、级数乘积的某些项。这些通常构成数值的最高有效部分或最低有效部分,例如在迭代逼近方案中计算初值或细化步骤时。其他情形则需要中间部分。本文针对一般问题提供算法:计算乘积中给定跨度内的系数,即单变量多项式中某个次数范围内的项,或整数的某个数位范围。这推广了Hanrot、Quercia和Zimmerman的“中间乘积”概念。我们主要关注规模适中的问题,其中常数加速因子可以改善整体系统性能,因此讨论集中于经典乘法和Karatsuba乘法,以及这些方法如何组合。
英文摘要:
Sometimes only some digits of a numerical product or some terms of a polynomial or series product are required. Frequently these constitute the most significant or least significant part of the value, for example when computing initial values or refinement steps in iterative approximation schemes. Other situations require the middle portion. In this paper we provide algorithms for the general problem of computing a given span of coefficients within a product, that is the terms within a range of degrees for univariate polynomials or range digits of an integer. This generalizes the "middle product" concept of Hanrot, Quercia and Zimmerman. We are primarily interested in problems of modest size where constant speed up factors can improve overall system performance, and therefore focus the discussion on classical and Karatsuba multiplication and how methods may be combined.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。