> Hi Rob, you understand more than I do - is this a bug (big step of > time needed for that type of calculation at an rather arbitrary > number)? Should I create a track ticket for that? Do you have also an > opinion on the various other points?
Actually, the cutoff changed: sage: type(Matrix(GF(previous_prime(2^23)),10,10)) <type 'sage.matrix.matrix_modn_dense_double.Matrix_modn_dense_double'> sage: type(M) <type 'sage.matrix.matrix_modn_dense_double.Matrix_modn_dense_double'> sage: %time M.right_kernel() CPU times: user 0.23 s, sys: 0.02 s, total: 0.25 s Wall time: 0.26 s Vector space of degree 1001 and dimension 1 over Finite Field of size 8388593 Basis matrix: 1 x 1001 dense matrix over Finite Field of size 8388593 sage: type(Matrix(GF(previous_prime(2^24)),10,10)) <type 'sage.matrix.matrix_generic_dense.Matrix_generic_dense'> sage: M = MatrixSpace(GF(previous_prime(2^24)), 1000, 1001).random_element(); sage: %time M.right_kernel() ... wait a long long time This cutoff is not arbitrary btw. but such that the product of two elements fits into a double (53 bits). Cheers, Martin -- name: Martin Albrecht _pgp: http://pgp.mit.edu:11371/pks/lookup?op=get&search=0x8EF0DC99 _otr: 47F43D1A 5D68C36F 468BAEBA 640E8856 D7951CCF _www: http://martinralbrecht.wordpress.com/ _jab: martinralbre...@jabber.ccc.de -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
