Simon,
But it DOES hold for dense matrices over GF(3):
sage: from sage.matrix.matrix_modn_dense import Matrix_modn_dense
sage: MS = MatrixSpace(GF(3),100,100)
sage: M = Matrix_modn_dense(MS, None,True,True)
sage: timeit("M = Matrix_modn_dense(MS, None,True,True)",
number=10000)
10000 loops, best of 3: 25.8 µs per loop
sage: timeit("N = copy(M)", number=10000)
10000 loops, best of 3: 13 µs per loop
I had a go at this and found that for larger matrices it doesnt seem to
hold (well for me at least)
sage: from sage.matrix.matrix_modn_dense import Matrix_modn_dense
sage: MS = MatrixSpace(GF(3),100,100)
sage: M = Matrix_modn_dense(MS, None,True,True)
sage: timeit("M = Matrix_modn_dense(MS, None,True,True)",number=100)
100 loops, best of 3: 373 ms per loop
sage: timeit("N = copy(M)", number=10000)
100 loops, best of 3: 402 ms per loop
with copying becoming more expensive the larger the matrices.
Robert Goss
--
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
