在这份报纸,一条使随机化的 Cayley-Hamilton 定理基于方法(由 RCH 方法缩短了) 为计算,一个多项式矩阵的最小的多项式被介绍。它到条款决定系数多项式条款从对更高的度更低。由使用随机的向量并且随机变,它不与概率一在输入矩阵和工作上要求条件。在给定的多项式矩阵的条目的系数都是整数并且算法在准确计算被执行的情况中,由使用模块化的技术, RCH 方法的一个 parallelized 版本也被给。有在两理论复杂性分析和计算测试的另外的算法的比较被给显示出它的有效性。
In this paper, a randomized Cayley-Hamilton theorem based method (abbreviated by RCH method) for computing the minimal polynomial of a polynomial matrix is presented. It determines the coefficient polynomials term by term from lower to higher degree. By using a random vector and randomly shifting, it requires no condition on the input matrix and works with probability one. In the case that coefficients of entries of the given polynomial matrix are all integers and that the algorithm is performed in exact computation, by using the modular technique, a parallelized version of the RCH method is also given. Comparisons with other algorithms in both theoretical complexity analysis and computational tests are given to show its effectiveness.