At the moment we don't use the BLAS, so linbox is still better. But I think Fredrik had some figures which show we beat Sage.
Moreover, our code works for primes up to 64 bits which isn't possible with the BLAS anyhow. I'll let Fredrik respond in more detail as he wrote the code. Bill. On Jan 17, 10:37 am, Martin Albrecht <martinralbre...@googlemail.com> wrote: > Congratulations. I'm curious: how does your mod p multiplication of matrices > compare ot LinBox's? > > Cheers, > Martin > > -- > name: Martin Albrecht > _pgp:http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 > _otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF > _www:http://martinralbrecht.wordpress.com/ > _jab: martinralbre...@jabber.ccc.de -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
