Displaying similar documents to “On hardly linearly provable systems”

On the computation of the minimal polynomial of a polynomial matrix

Nicholas Karampetakis, Panagiotis Tzekis (2005)

International Journal of Applied Mathematics and Computer Science

Similarity:

The main contribution of this work is to provide two algorithms for the computation of the minimal polynomial of univariate polynomial matrices. The first algorithm is based on the solution of linear matrix equations while the second one employs DFT techniques. The whole theory is illustrated with examples.