Another possible solution is to sort the numbers and add them in a
binary tree. It reduces the truncation error but makes the problem n-
log-n and therefore not worth the trouble.
Massimo
On May 29, 2012, at 9:45 AM, Pauli Virtanen wrote:
> Val Kalatsky gmail.com> writes:
>> You'll need some
This problem is linear so probably Ram IO bound. I do not think I
would benefit much for multiple cores. But I will give it a try. In
the short term this is good enough for me.
On May 22, 2012, at 1:57 PM, Francesc Alted wrote:
> On 5/22/12 8:47 PM, Dag Sverre Seljebotn wrote:
>> On 05/22/20
Thank you Dag,
I will look into it. Is there any documentation about ufunc?
Is this the file core/src/umath/ufunc_object.c
Massimo
On May 22, 2012, at 1:47 PM, Dag Sverre Seljebotn wrote:
> On 05/22/2012 04:54 PM, Massimo DiPierro wrote:
>> For now I will be doing this:
>>
>> import numpy
>> i
