Hi Tom, On 1 Dez., 10:08, Tom Boothby <tomas.boot...@gmail.com> wrote: > Yeah, Sage has one implemented in Cython. Use MeatAXE for the base > case of a reasonable size based on the dimension / prime.
I know about that. Actually, I wrote the current generic implementation of Strassen-Winograd multiplication in Sage, following an advice of Ivo Hedtke, who pointed me to an article of Boyer, Pernet and Zhou. However, it is much better (i.e., with noticeably less overhead) to implement the same algorithm directly in MeatAxe (which is what I did). @Martin: Using the generic Sage implementation of asymptotically fast Gaussian elimination on MeatAxe matrices is not so good, at least on 2000x2000 matrices over GF(125), where it takes 700 seconds (while the classical algorithm in MeatAxe needs <12 seconds). Cheers, Simon -- 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
