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

关于双字加法算法的鲁棒性

On the robustness of double-word addition algorithms

Yuanyuan Yang, XinYu Lyu, Sida He, Xiliang Lu, Ji Qi, Zhihao Li

AI总结:

该研究证明QD库中的双字加法算法在输入适度重叠时仍有稳定误差界,可简化双字乘加运算步骤以近翻倍提升性能且精度损失极小,还验证了其在有向舍入下的特性及与Sterbenz引理的关联,表明算法鲁棒性优于此前认知。

摘要:

我们证明,即使QD库中的粗略或精确双字加法算法的输入存在适度重叠,这些算法在忠实舍入下仍能保证误差界为$O(u^2(|a|+|b|))$。此外,当舍入函数为就近舍入时,在输入存在适度重叠的情况下,精确算法可实现$O(u^2)$的相对误差界。该相对误差界在有向舍入中也成立,但需要满足某些额外条件。因此,在双字乘法和加法运算中,我们可以安全地省略双字乘法的归一化步骤,并用粗略加法算法替代精确加法算法。数值实验证实,该方法使双字乘法和加法运算的性能几乎提升一倍,而精度代价可忽略不计。此外,在有向舍入模式下,即使存在输入重叠,两种算法的误差符号也与舍入方向一致。这使得我们在区间算术中无需更改舍入模式。我们还证明,当采用就近舍入时,当且仅当输入满足Sterbenz引理的条件时,粗略加法算法的相对误差界才会超过$3u^2$。这些发现表明,这两种加法算法的鲁棒性比此前认为的更强。

英文摘要:

We demonstrate that, even when there are moderate overlaps in the inputs of sloppy or accurate double-word addition algorithms in the QD library, these algorithms still guarantee error bounds of $O(u^2(|a|+|b|))$ in faithful rounding. Furthermore, the accurate algorithm can achieve a relative error bound of $O(u^2)$ in the presence of moderate overlaps in the inputs when rounding function is round-to-nearest. The relative error bound also holds in directed rounding, but certain additional conditions are required. Consequently, in double-word multiplication and addition operations, we can safely omit the normalization step of double-word multiplication and replace the accurate addition algorithm with the sloppy one. Numerical experiments confirm that this approach nearly doubles the performance of double-word multiplication and addition operations, with negligible precision costs. Moreover, in directed rounding mode, the signs of the errors of the two algorithms are consistent with the rounding direction, even in the presence of input overlap. This allows us to avoid changing the rounding mode in interval arithmetic. We also prove that the relative error bound of the sloppy addition algorithm exceeds $3u^2$ if and only if the input meets the condition of Sterbenz's Lemma when rounding to nearest. These findings suggest that the two addition algorithms are more robust than previously believed.

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

↑