On the Robustness of the 2Sum and Fast2Sum Algorithms.
ACM Trans. Math. Softw.(2017)
摘要
The 2Sum and Fast2Sum algorithms are important building blocks in numerical computing. They are used (implicitely or explicitely) in many compensated algorithms (such as compensated summation or compensated polynomial evaluation). They are also used for manipulating floating-point expansions. We show that these algorithms are much more robust than it is usually believed: The returned result makes sense even when the rounding function is not round-to-nearest, and they are almost immune to overflow.
更多查看译文
关键词
Floating-point,error-free transformation,rounding errors,faithful rounding,2Sum,Fast2Sum
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要