By Topic

Resultant Based Methods Computing the Greatest Common Divisor of Several 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

3 Author(s)
Triantafyllou, D. ; Dept. of Math., Athens Univ. ; Mitrouli, M. ; Karcanias, N.

In this paper we develop two resultant based methods for the computation of the greatest common divisor (GCD) of many polynomials. Let S be the resultant Sylvester's matrix of the polynomials. The application of classical LU and QR factorization to S for the computation of its GCD has an inappropriate complexity of order O(n4). We modified matrix S to S* such that the rows with non-zero elements under the main diagonal, at every column, are gathered together. We constructed modified versions of the LU and QR procedures which lead to the computation of the GCD of S* in O(n3) floating point operations. Both methods are tested for several sets of polynomials and tables summarizing all the achieved results are given

Published in:

Intelligent Control, 2005. Proceedings of the 2005 IEEE International Symposium on, Mediterrean Conference on Control and Automation

Date of Conference:

27-29 June 2005