Nathaniel Smith <n...@pobox.com> wrote: > The problem here is that when summing up the values, the sum gets > large enough that after rounding, x + 1 = x and the sum stops > increasing.
Interesting. That explains why the divide-and-conquer reduction is much more robust. Thanks :) Sturla _______________________________________________ NumPy-Discussion mailing list NumPy-Discussion@scipy.org http://mail.scipy.org/mailman/listinfo/numpy-discussion
