Greatest common divisor via generalized Sylvester and Bezout matrices

Abstract
We present new methods for computing the greatest common right divisor of polynomial matrices. These methods involve the recently studied generalized Sylvester and generalized Bezoutian resultant matrices, which require no polynomial operations. They can provide a row proper greatest common right divisor, test for coprimeness and calculate dual dynamical indices. The generalized resultant matrices are developments of the scalar Sylvester and Bezoutian resultants and many of the familiar properties of these latter matrices are demonstrated to have analogs with the properties of the generalized resultant matrices for matrix polynomials.

This publication has 16 references indexed in Scilit: