| Title: | Summation problem revisited - more robost computation |
| Authors: | Skala, Václav |
| 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. |
| Issue Date: | 2013 |
| Publisher: | WSEAS |
| Document type: | konferenční příspěvek conferenceObject |
| URI: | http://hdl.handle.net/11025/11774 |
| ISBN: | 978-960-474-311-7 |
| Keywords: | algoritmy;násobení matic;robustní metody;rekurzivní metody;lineární algebra |
| Keywords in different language: | algorithms;matrix multiplication;robust methods;recursive methods;linear algebra |
| 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. |
| Rights: | Original paper published under copyright licence: © 2013 WSEAS |
| Appears in Collections: | Konferenční příspěvky / Conference Papers (KIV) |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| Skala_2013_CSCC-Summation.pdf | Plný text | 733,22 kB | Adobe PDF | View/Open |
Please use this identifier to cite or link to this item:
http://hdl.handle.net/11025/11774Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.