I need to compute charpoly of big sparse matrices obtained in sage, but there is no efficient algorithm in sage for the moment. So I would like to implement it and add it to sage. I think it already exists in gp or in linbox, but I was not able to use it in sage. Maybe sage has no proper way to convert a sparse matrix to give it to gp or to linbox ? Does somebody knows how to do that ?
Thank you, Paul -- 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 http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.