Summation problem revisited - more robost computation

Date issued

2013

Journal Title

Journal ISSN

Volume Title

Publisher

WSEAS

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(N2) 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.

Description

Subject(s)

algoritmy, násobení matic, robustní metody, rekurzivní metody, lineární algebra

Citation

Recent Advances in Computer Science: Proceedings of the 17th International Conference on Computers (Part of CSCC '13), Proceedings of the 1st International Conference on Artificial Intelligence and Cognitive Science (AICS '13), Proceedings of the 1st International Conference on Innovative Computing and Information Processing (INCIP'13), p. 56-64.
OPEN License Selector