On Mon, Jan 17, 2011 at 12:13 PM, Bill Hart <[email protected]> wrote: > But I think Fredrik had some figures which show we beat Sage.
Yes, even for small primes. Multiplying two 1000x1000 matrices mod p = 17 takes 2.27 seconds in Sage and 1.05 seconds with FLINT 2's nmod_mat's. The corresponding time in FLINT 2 for a 50-bit prime is 1.6 seconds, and 2.6 seconds for a full 64-bit prime (these would currently be extremely slow in Sage). This is just on my computer; results elsewhere may be entirely different. We can probably improve nmod_mat performance a bit more. Ultimately, BLAS will likely be faster for moduli in the appropriate range, however. Fredrik -- To post to this group, send an email to [email protected] To unsubscribe from this group, send an email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
