By Topic

An algorithm for GCF extraction from two multivariable 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
$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

1 Author(s)
Bose, N.K. ; University of Pittsburgh, Pittsburgh, Pa.

An algorithm is given for the extraction of the greatest common factor from two multiraiable polynomials based on an extension of Trudi's remit for single-variable polynomials. Nontrivial examples are used to illustrate the procedure, which has potential applications in several system theory problems.

Published in:

Proceedings of the IEEE  (Volume:64 ,  Issue: 1 )