By Topic

A matrix pencil based numerical method for the computation of the GCD of polynomials

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
$33 $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

2 Author(s)
N. Karcanias ; Control Eng. Centre, City Univ., London, UK ; M. Mitrouli

The paper presents a new numerical method for the computation of the greatest common divisor (GCD) of an m-set of polynomials of R[s], P m,d, of maximal degree d. It is based on a previously proposed theoretical procedure (Karcanias, 1989) that characterizes the GCD of Pm,d as the output decoupling zero polynomial of a linear system S(Aˆ,Cˆ) that may be associated with Pm,d . The computation of the GCD is thus reduced to finding the finite zeros of the pencil sW-AW, where W is the unobservable subspace of S(Aˆ,Cˆ). If k=dim W, the GCD is determined as any nonzero entry of the kth compound Ck(sW-AˆW). The method defines the exact degree of GCD, works satisfactorily with any number of polynomials and evaluates successfully approximate solutions

Published in:

IEEE Transactions on Automatic Control  (Volume:39 ,  Issue: 5 )