Polynomials for the Jordan decomposition in characteristic p Original Research Article

Given a polynomial in characteristic p, the algorithm here will (without factorization) find a separable polynomial with the same irreducible factors or prove that none exists. This is what is needed to compute the Jordan decomposition of a matrix in characteristic p. Supplementary propositions and examples indicate how to carry out the computations over finitely generated fields.