I'm sure that Sage already has code for Weak Popov Form. I
implemented it myself in about 2004 but from the date you can tell
that it was not in Sage (but Magma).
Indeed, search_src("popov") finds
matrix/matrix_misc.py:32:def weak_popov_form(M,ascend=True):
John
On 17 November 2016 at 15:27, 'Bill Hart' via sage-devel
<sage-devel@googlegroups.com> wrote:
> A colleague suggested to look at the Popov form. I didn't look at what Sage
> is currently doing, so my apologies if this turns out to not be a useful
> comment.
>
> Here is a random paper on this that I found [1].
>
> Bill.
>
> [1] http://perso.ens-lyon.fr/gilles.villard/BIBLIOGRAPHIE/PDF/issac96.pdf
>
> On Tuesday, 15 November 2016 10:01:09 UTC+1, Kwankyu Lee wrote:
>>
>> Hi,
>>
>> The current Hermite normal form algorithm in Sage for matrices over k[x]
>> seems embarrassingly slow. It is a generic algorithm for matrices over PIDs.
>> What would be possible ways to improve the situation? Any reference to
>> literature or implementations or like would be welcome. Thanks.
>>
> --
> 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.
--
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.
