It also argues that most of these entries are not used for typical data with limited range. In any case, it claims at most a factor of two benefit from the “fast” method vs. the “small” method; I suspect that most cases requiring an exactly rounded sum are not performance-critical enough for this to matter. It would be nice to have an implementation of at least the “small” method in a Julia package for people who need exactly rounded floating-point sums.
stevengj
27
Related topics
| Topic | Replies | Views | Activity | |
|---|---|---|---|---|
| Speed issue with KahanSummation | 12 | 1457 | February 5, 2022 | |
| Accurate summation algorithm | 34 | 10806 | December 1, 2017 | |
| Optimizing sums of products (dot products) | 17 | 1040 | September 24, 2024 | |
| Sum of float64 vector gives slightly incorrect answer | 44 | 5676 | April 29, 2019 | |
| Julia speed | 28 | 3164 | March 14, 2024 |