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 ter...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.展开更多
基金supported by the National Natural Science Foundation of China under Grant No.11171051the Major Research plan of the National Natural Science Foundation of China under Grant No.91230103the Fundamental Research Funds for the Central Universities under Grant No.DUT14RC(3)023
文摘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.
