On Tuesday, May 29, 2012, Emil <emi...@gmail.com> wrote: > Calling .echelonize on a rational matrix, I received: > > File "matrix_rational_dense.pyx", line 1432, in > sage.matrix.matrix_rational_dense.Matrix_rational_dense.echelonize > (sage/matrix/matrix_rational_dense.c:14327) > File "matrix_rational_dense.pyx", line 1583, in > sage.matrix.matrix_rational_dense.Matrix_rational_dense._echelonize_padic > (sage/matrix/matrix_rational_dense.c:15712) > File "matrix_integer_dense.pyx", line 3856, in > sage.matrix.matrix_integer_dense.Matrix_integer_dense._rational_echelon_via_solve > (sage/matrix/matrix_integer_dense.c:28752) > RuntimeError: Bug in _rational_echelon_via_solve in finding linearly > independent rows. > > When I re-ran it, everything worked.... Looking at the source code, it > appears to be using a random algorithm, that has 50 tries at something > before bailing out with the above error. > > I am impressed at how fast this code is, but I'm a bit worried now > about using this in "production" code.... Could the code be patched so > that instead of bailing out with an error, a slow non-random method > was used instead? (I don't feel competent myself to make such a > change...) > > Emil
Can you give an example? E.g., a matrix and a random seed? > > -- > 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 > -- William Stein Professor of Mathematics University of Washington http://wstein.org -- 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
