[mpir-devel] Re: binomial calculation wrong?

2011-12-31 Thread Cactus
The bug is in your mpir_bincoef subroutine where you use a routine that returns a double as follows: ret = mpz_get_d(result); to set a 64-bit value in ret: Since a double on Windows has a 53 bit mantissa, this will give wrong values for 64-bit values with longer bit lengths than this. If

Re: [mpir-devel] mpn_sumdiff_n on penryn

2011-12-31 Thread Jason
On Tuesday 27 December 2011 17:27:48 Bill Hart wrote: In my FFT I make use of mpn_sumdiff_n and mpn_addsub_n. It seems these are not exported even though there are generic C versions. Also, I see there is no sumdiff_n.as on core2 style machines. Is it possible to include mpn_sumdiff_n.c in

Re: [mpir-devel] mpn_sumdiff_n on penryn

2011-12-31 Thread Bill Hart
For the FFT the aliasing is not so important, as the butterfly can be done into temporary space then swapped. I use this strategy a lot and it doesn't affect the FFT timings. Bill On 31 December 2011 18:22, Jason ja...@njkfrudils.plus.com wrote: On Saturday 31 December 2011 17:47:03 Jason

Re: [mpir-devel] mpn_sumdiff_n on penryn

2011-12-31 Thread Bill Hart
Would it be possible to set a flag HAVE_MPN_SUMDIFF_N in mpir.h if this function is available and similarly for addsub? That way code like mine could use these functions when they are available by conditionally including alternatives in the cases where these defines don't exist. Obviously this

[mpir-devel] Re: FFT progress

2011-12-31 Thread Bill Hart
I have finished implementing and debugging a new Nussbaumer convolution. It isn't the absolutely fastest possible thing one can do, but it is still slightly better than what is in mpir. The fourth column in the following table shows the times for the new code. It is only used from a certain point