Just for the record, I'm answering to myself: > I'm also thinking of Danilevskii's elimination: although it could be > viewed as a Krylov method, it does not use any randomization, so could > it always give the whole minpoly ?
I checked that this does not solve our pb: Danilevskii's alg is deterministic for charpoly but still can choose bad vectors for minpoly. A conter-example is [1 1] [0 1] for which Danilevskii's alg implicitly uses the first column vector [1] [0] which only produces the factor X-1 of the minpoly Clément --~--~---------~--~----~------------~-------~--~----~ 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 URLs: http://www.sagemath.org -~----------~----~----~----~------~----~------~--~---
