A robust solution of the generalized polynomial Bézout identity
The authors present a robust algorithm for the computation of all matrices of the generalized polynomial Bézout identity, together with an algorithm for the computation of minimal polynomial basis for the null space of polynomial matrices. This algorithm exploits singular value decompositions of certain real matrices. Two interesting examples enlighten in detail the effectiveness of the proposed algorithms.
matrix polynomials, minimal polynomial basis
scientific article; zbMATH DE number 2083517
scientific article