Set: n = 100000 A = matrix(QQ, n, 1, range(n)) B = A.sparse_matrix() v = vector((0,))
The trivial calculation sol = A.solve_left(v) instantly yields a solution (the all 0 vector), while sol = B.solve_left(v) takes forever ... !!! I haven't looked at the implementation, but it seems to me that there is a highly inefficient handling of sparse matrices. -- Peter Mueller -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/sage-support/a051a430-276b-445b-ae36-6afba9e6aecfn%40googlegroups.com.
