Check out RSS, or use RSS reader to subscribe this item
Confirmation
Authentication email has already been sent, please check your email box: and activate it as soon as possible.
You can login to My Profile and manage your email alerts.
Sponsored by the Center for Science and Technology Development of the Ministry of Education
Supervised by Ministry of Education of the People's Republic of China
In this paper, an efficient algorithm 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. Comparison with other algorithms in both theoretical complexity analysis and computational tests are given to show its effectiveness.