DocumentCode :
1135964
Title :
Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator
Author :
Griss, Martin L.
Author_Institution :
Department of Computer Science, University of Utah
Issue :
10
fYear :
1978
Firstpage :
945
Lastpage :
950
Abstract :
In this paper, the use of an efficient sparse minor expansion method to directly compute the subresultants needed for the greatest common denominator (GCD) of two polynomials is described. The sparse minor expansion method (applied either to Sylvester´s or Bezout´s matrix) naturally computes the coefficients of the subresultants in the order corresponding to a polynomial remainder sequence (PRS), avoiding wasteful recomputation as much as possible. It is suggested that this is an efficient method to compute the resultant and GCD of sparse polynomials.
Keywords :
Inners; minor expansion; polynomial GCD; sparse matrices; sparse polynomials; subresultants; Cities and towns; Computer science; Iterative algorithms; Polynomials; Sparse matrices; Inners; minor expansion; polynomial GCD; sparse matrices; sparse polynomials; subresultants;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1978.1674974
Filename :
1674974
Link To Document :
بازگشت