Computing Minimal Polynomial of Matrices over Algebraic Extension Fields
Amir Hashemi, Benyamin M.-Alizadeh · 2013
In this paper, we present a new and ecient algorithm for computing minimal poly- nomial of matrices over algebraic extension elds using the Grobner bases technique. We have implemented our algorithm in Maple and we evaluate its performance and compare it to the performance of the function MinimalPolynomial of Maple 15 and also of the Bia las algorithm as a new algorithm to compute minimal polynomial of matrices.