Amir Hashemi and Benyamin M.-Alizadeh: Computing Minimal Polynomial of Matrices over Algebraic Extension Fields, p.217-228

Abstract:

In this paper, we present a new and efficient algorithm for computing minimal polynomial of matrices over algebraic extension fields using the Gröbner 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 Biaas algorithm as a new algorithm to compute minimal polynomial of matrices.

Key Words: Minimal Polynomial, Gröbner Bases, Algebraic Extension Fields.

2000 Mathematics Subject Classification: Primary: 15A15;
Secondary: 13P10.

Download the paper in pdf format here.