.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
In this article, we combine recursive summation techniques with Kahan-Babuska type balancing strategies [ 1], [ 7] to get highly accurate summation formulas. An i-th algorithm have only O(n(log(2)(n)epsilon)(i+1)) error beyond 1upl and thus allows to sum many millions of numbers with high accuracy. The additional afford is a small multiple of the naive summation. In addition we show that these algorithms could be modified to provide tight upper and lower bounds for use with interval arithmetic.
Keyword:
floating-point numbers
rounding errors
summation algorithm
interval arithmetic
期刊
C
IF:
2.8
论文数:
2.3K
被引数:
3.5K
机构
暂无机构信息
.png){kind=icon}
没有更多内容