The CHACM method for computing the characteristic polynomial of a polynomial matrix

This paper presents an efficient algorithm for computing the characteristic polynomial of a matrix, which utilizes Cayley-Hamilton's theorem. The algorithm requires no condition on input matrix and carl be performed only with basic matrix operations except only one computation of inverse of constant matrix. Though the algorithm can be applied to a constant matrix, it is the most effective when applied to a matrix with polynomial entries. Computational tests are given to compare the algorithm with conventional ones.