论文标题
总结问题重新审视 - 更强大的计算
Summation Problem Revisited -- More Robust Computation
论文作者
论文摘要
数值数据处理是计算机技术使用不同字段的关键任务。但是，由于浮点表示的使用，即使是简单的值也不精确。本文提出了一种实用算法，用于求和中等和大数据集的值。提出的算法很简单，易于实现。与O（n^2）运行时复杂性相反，其计算复杂性是O（n）。对于指数数据显着差异并且将许多小值总结为较高的值时，提出的算法特别方便
Numerical data processing is a key task across different fields of computer technology use. However, even simple summation of values is not precise due to the floating point representation use. This paper presents a practical algorithm for summation of values convenient for medium and large data sets. The proposed algorithm is simple, easy to implement. Its computational complexity is O(N) in the contrary of the Exact Sign Summation Algorithm (ESSA) approach with O(N^2) run-time complexity. The proposed algorithm is especially convenient for cases when exponent data differ significantly and many small values are summed with higher values
