arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1006.0405math.NAcs.CRcs.DScs.NA
收藏

使用复区间算术对Schönhage-Strassen整数乘法算法的严格扩展

A Rigorous Extension of the Schönhage-Strassen Integer Multiplication Algorithm Using Complex Interval Arithmetic

University of Canterbury(坎特伯雷大学)

Thomas Steinke, Raazesh Sainudiin

AI总结:

针对Schönhage-Strassen算法在浮点硬件上的舍入误差问题,提出使用区间算术保证结果正确性并确定硬件极限,实验表明双精度可处理75000位256进制整数。

摘要:

通过长乘法对n位整数进行乘法运算需要O(n^2)次操作,且可能耗时。1970年,A. Schönhage和V. Strassen发表了一种算法,能够在复数域C上仅用O(n log(n))次算术运算完成该任务;自然,使用C的有限精度近似并需要考虑舍入误差。总体而言,使用可变精度定点数,这导致了一个O(n(log(n))^(2+Epsilon))时间的算法。然而,为了使该算法更高效和实用,我们需要利用基于硬件的浮点数。我们如何处理舍入误差?以及如何确定固定精度硬件的极限?我们的解决方案是使用区间算术来保证结果的正确性并确定硬件的极限。我们考察了该方法的可行性,并能够报告使用双精度包含集可以处理75,000位基256整数。这清楚地表明我们的方法具有实际潜力;然而,现阶段,我们的实现尚不能与商业实现竞争,但我们能够证明该技术的可行性。

英文摘要:

Multiplication of n-digit integers by long multiplication requires O(n^2) operations and can be time-consuming. In 1970 A. Schoenhage and V. Strassen published an algorithm capable of performing the task with only O(n log(n)) arithmetic operations over the complex field C; naturally, finite-precision approximations to C are used and rounding errors need to be accounted for. Overall, using variable-precision fixed-point numbers, this results in an O(n(log(n))^(2+Epsilon))-time algorithm. However, to make this algorithm more efficient and practical we need to make use of hardware-based floating-point numbers. How do we deal with rounding errors? and how do we determine the limits of the fixed-precision hardware? Our solution is to use interval arithmetic to guarantee the correctness of results and determine the hardware's limits. We examine the feasibility of this approach and are able to report that 75,000-digit base-256 integers can be handled using double-precision containment sets. This clearly demonstrates that our approach has practical potential; however, at this stage, our implementation does not yet compete with commercial ones, but we are able to demonstrate the feasibility of this technique.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑