Hi, I might use sparse numeric matrices (coefficients typically in QQ or some finite field) for computing reductions of a polynomial mod some other polynomials. Currently this is a bit far away and I don't really know the specifics other than that the matrices are sparse in general.
Jeremias -- You received this message because you are subscribed to the Google Groups "sympy" group. To post to this group, send email to sympy@googlegroups.com. To unsubscribe from this group, send email to sympy+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/sympy?hl=en.
