COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME

作     者：JIN-YI CAI 

作者机构：Department of Computer Science State University of New York Buffalo NY 14260 U.S.A. 

出 版 物：《International Journal of Foundations of Computer Science》 

年 卷 期：1994年第5卷第3N04期

页      面：293-302页

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Jordan normal form polynomial time algorithm commutative matrices algebraic extension field Galois group 

摘      要：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.