COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
Jin‐Yi Cai · International Journal of Foundations of Computer Science · 1994
Given a rational matrix A, and a set of rational matrices B, C,… which commute with A, we give polynomial time algorithms to compute exactly the Jordan Normal Form of A, as well as the transformed matrices of B, C,…. We also obtain the transformation matrix and its inverse exactly in polynomial time.