PREPRINT

Summation Problem Revisited -- More Robust Computation

Vaclav Skala

Submitted on 8 November 2022

Abstract

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

Preprint

Comment: 9 pages, 3 Figs, 3 Tabs. Presented at Recent Advances in Computer Science Conf, 2013

Subjects: Computer Science - Data Structures and Algorithms; Mathematics - Numerical Analysis; F.2.1

URL: http://arxiv.org/abs/2211.04402