I believed that matrix multiplication and squaring to be significantly faster over GF(p) instead over ZZ.
Numerical evidence supports the opposite, is it a bug or reality? Session: def randmat(N,K): return Matrix(K,N,N,[K.random_element() for _ in range(N^2)]) N=200 Kq=GF(next_prime(2^200)) M1=randmat(N,Kq) %time MsZZ=M1.change_ring(ZZ)^2 #Wall time: 188 ms %time Msqu=M1^2 #Wall time: 7.75 s -- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion visit https://groups.google.com/d/msgid/sage-devel/CAGUWgD99vQZna7jiH7g6kY56mJAeOa8hyOLaSR6Ep79ixiu7ew%40mail.gmail.com.
