Ok, thank you I will look at this. Paul
Le vendredi 28 mars 2014 10:38:41 UTC+1, Marc Mezzarobba a écrit : > > Paul Mercat wrote: > > OK, thank you, I see. > > It's an efficient method to compute a approximation of the spectral > > radius. It's good but I still want to have the exact value. > > You can use the same idea to compute the minimal polynomial of your > matrix (with high probability). This is the starting point of > Wiedemann's algorithm for the solution of black-box linear systems, see > the first section of > > http://en.wikipedia.org/wiki/Block_Wiedemann_algorithm > > And I think Linbox indeed implements this algorithm as well as various > more sophisticated variants. > > -- > Marc > > -- 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.
