I uploaded a new NTL version (9.7.1) to http://www.shoup.net/ntl This version completes the implementation of faster matrix arithmetic (mul, inv, gauss, etc) modulo small primes.
These new implementations are more cache friendly, and they make more intelligent use of available hardware (e.g., AVX). They also can be accelerated in a multicore environment. I've run some tests that show that this implementation is "not too bad" compared to FFLAS/FFPACK based on OpenBLAS. I've also updated my NTL vs FLINT comparisons to include some benchmarks for matrix arithmetic mod small primes. You can also see those results at http://www.shoup.net/ntl/benchmarks.pdf -- 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 sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.