By Topic

Greatest common divisor via generalized Sylvester and Bezout matrices

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Bitmead, R.R. ; University of Newcastle, New South Wales, Austrailia ; Kung, S.-Y. ; Anderson, B.D.O. ; Kailath, T.

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.

Published in:

Automatic Control, IEEE Transactions on  (Volume:23 ,  Issue: 6 )