Computing Jordan Normal Forms Exactly for Commuting Matrices in Polynomial Time
Computing Jordan Normal Forms Exactly for Commuting Matrices in Polynomial Time
复制标题
精确计算多项式时间内通勤矩阵的乔丹范式
DOI：
10.1142/s0129054194000165
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
Jin
中科院分区：
文献类型：
--
作者：
Jin
给定一个有理矩阵A，以及一组与A可交换的有理矩阵B，C，.，我们给出了多项式时间算法来精确计算A的Jordan标准形，以及B，C，.的变换矩阵。我们还在多项式时间内精确地得到了变换矩阵及其逆矩阵。
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.