No Access
COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME
https://doi.org/10.1142/S0129054194000165Cited by:17 (Source: Crossref)
Abstract
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.
Research supported in part by NSF grants CCR 9057486 and CCR 9319093, and an Alfred P. Sloan Fellowship.
Keywords:
