I definitely want to use BLAS when it is appropriate. The reason is
that GOTO BLAS has been open sourced, under a BSD style license. So it
is now trivial to install an extremely high performance BLAS (takes ~
90s to install on my machine). Rather than use bits and pieces of
GOTO, I think it is bett
On Mon, Jan 17, 2011 at 12:13 PM, Bill Hart 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
I just checked the FLINT implementation and there is this note:
/* TODO: optimise this */
static void
nmod_mat_addmul_classical(nmod_mat_t C, const nmod_mat_t A, const
nmod_mat_t B)
So my guess is at the moment we wouldn't be competitive everywhere. I
think the times we really win are when the mo
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 1
Congratulations, this looks really good.
--
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
