On Mar 30, 8:24 pm, Christophe Oosterlynck <tif...@gmail.com> wrote: > Hi, > > Consider matrices containing univariate polynomials over GF(2): is it > normal that calculating the smith normal form for such a matrix is > extremely slow?
I wrote the smith_form code, and it's completely generic, applying to an arbitrary ring; at the time I was actually thinking mainly about matrices over the rings of integers of Euclidean quadratic fields. There are absolutely no optimised Smith form implementations specific to any rings except ZZ. That's why it's slow in your example. (I'm actually pleasantly surprised that it works at all.) David --~--~---------~--~----~------------~-------~--~----~ To post to this group, send email to sage-devel@googlegroups.com To unsubscribe from this group, send email to sage-devel-unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
