On Feb 4, 1:03 am, daveloeffler wrote:
> > 2. The Linbox implementation and the Pari implementation differ by a
> > transpose; that is, if you really want the two to agree on some matrix
> > m, you need to compare
>
> Ah, I think you've just uncovered an inconsistency.
I think I just found ano
On Feb 4, 2:31 am, mabshoff wrote:
> On Feb 3, 10:52 pm, John H Palmieri wrote:
[snip]
> > For a 719 x 1347 sparse integer matrix m6:
>
> > sage: timeit("m6.dense_matrix().elementary_divisors
> > (algorithm='pari')", number=1)
> > 1 loops, best of 3: 23.9 s per loop
> > sage: timeit("m6.dense_
On Feb 3, 10:52 pm, John H Palmieri wrote:
Hi John,
> Almost two years ago, Linbox's implementation of Smith normal form was
> taken out of Sage because it was too buggy. After some work, I managed
> to reinstate it, hoping that the bugs might have been fixed. Here's a
> partial status repor
> 2. The Linbox implementation and the Pari implementation differ by a
> transpose; that is, if you really want the two to agree on some matrix
> m, you need to compare
Ah, I think you've just uncovered an inconsistency.
By definition, the elementary divisors of m.transpose() are equal by
defin
