Sage Folks, I am working on a problem that requires me to generate a large matrix over QQ, and then calculate the row-echelon form. I think there's a good chance I can speed up the calculations if I use the Chinese Remainder Theorem to translate rationals into equivalent vectors of small integers, then do modular arithmetic on the vectors, and at the end translate the vectors back into rationals.
This is a pretty standard trick, so I thought I would see a way in Sage to do this without writing the machinery myself. But so far I haven't found it. Am I not looking in the right place, or is it really not there? Also, is it reasonable for me to think this is likely to speed up the calculations? Thanks for the help, Jeff Stroomer -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
