Matrix_integer_dense.rank first tries to establish that the matrix has full rank modulo a random prime. If this fails, it calls Linbox. As far as I can see, the rank() function in Linbox (in matrix-rank.h) also just computes the rank modulo one random prime. Am I just looking at the wrong functions, or is this actually not rigorous?
Fredrik -- -- 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
