A robust solution of the generalized polynomial Bezout identity Original Research Article

In this paper, algorithms for the computation of all matrices of the generalized polynomial Bezout identity are proposed. The algorithms are based on the computation of minimal polynomial basis for the right null spaces of certain polynomial matrices. For this reason, an algorithm for the computation of minimal polynomial bases is also proposed. Since this algorithm relies solely on singular value decompositions of certain real matrices, formed with the coefficients of the polynomial matrix whose minimal polynomial bases one is interested in finding, it can be said to be robust.