Le vendredi 18 novembre 2016 04:44:49 UTC+1, Kwankyu Lee a écrit :
> I am not a big fan of the suggested asymptotically best algorithms relying
> on auxiliary tools, which would be hard to implement and gain for small
> matrices might be not much.
>
For sure; I do not know precisely what the thresholds are like, but for
matrices of both small dimension and small degree (I see 10 x 10 matrices
of degree 10 in your examples), these algorithms are probably not much
faster (or maybe even slower) than simpler algorithms like
Mulders-Storjohann's one.
Having reasonably efficient implementations of such basic algorithms for
K[X]-matrices would be a nice addition to Sage (even the product of
K[X]-matrices is quite slow); let's hope we will get the situation improved
during my Post-doc with Johan.
Best,
Vincent
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To post to this group, send email to sage-devel@googlegroups.com.
Visit this group at https://groups.google.com/group/sage-devel.
For more options, visit https://groups.google.com/d/optout.
