arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.2266cs.DCcs.DMmath.NT
收藏

加速整数GCD算法的改进

Improvements on the accelerated integer GCD algorithm

Sidi Mohamed Sedjelmaci, Christian Lavault

摘要:

本文对右移$k$-元整数GCD算法的$k$-元约简中求整数$(a,b)$-元对的算法进行了分析和改进。虽然韦伯的“加速整数GCD算法”的最坏情况的复杂性是$\cOł(\log_ϕ(k)^2\r)$,我们表明,最坏情况下的迭代次数的while循环正好是$\tfrac 12 ł\lfloor \log_ϕ(k)\r\rfloor$,其中$ϕ:= \tfrac 12 ł(1+\sqrt{5}\r)$。\par我们建议后者的平均复杂度的改进,也提出了两个新的更快的剩余算法:顺序和并行之一。同时给出了并行残差算法中避免while循环的概率下界。

英文摘要:

The present paper analyses and presents several improvements to the algorithm for finding the $(a,b)$-pairs of integers used in the $k$-ary reduction of the right-shift $k$-ary integer GCD algorithm. While the worst-case complexity of Weber's "Accelerated integer GCD algorithm" is $\cOł(\log_ϕ(k)^2\r)$, we show that the worst-case number of iterations of the while loop is exactly $\tfrac 12 ł\lfloor \log_ϕ(k)\r\rfloor$, where $ϕ:= \tfrac 12 ł(1+\sqrt{5}\r)$.\par We suggest improvements on the average complexity of the latter algorithm and also present two new faster residual algorithms: the sequential and the parallel one. A lower bound on the probability of avoiding the while loop in our parallel residual algorithm is also given.

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

↑