3 ms·
The argumentation in the article is bad at some points. First, it praises the fast execution of pairwise addition with a large base case. Second, it praises pai
by madez 11y ago
The argumentation in the article is bad at some points. First, it praises the fast execution of pairwise addition with a large base case. Second, it praises pairwise addition as accurate with O(E) in the base case. Following this argumentation, making the base case as big as possible would be optimal. However, that would result in naive summation in practice. Thus, the argumentation is bad.
- bazzargh 11y agoIt looks like a bad edit to the wiki. https://en.wikipedia.org/w/index.php?title=Pairwise_summation&diff=643560917&oldid=643548127 https://en.wikipedia.org/w/index.php?title=Pairwise_summatio... ^ this user changed the error bounds, incorrectly. The worst case for the naive sum is pretty obviously epsilon*N (and is described that way on the Kahan sum page)
- deleted 11y ago[deleted]