|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator
October 1978 (vol. 27 no. 10)
pp. 945-950
| ASCII Text | x | ||
| M.L. Griss, "Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator," IEEE Transactions on Computers, vol. 27, no. 10, pp. 945-950, October, 1978. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1978.1674974, author = {M.L. Griss}, title = {Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator}, journal ={IEEE Transactions on Computers}, volume = {27}, number = {10}, issn = {0018-9340}, year = {1978}, pages = {945-950}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1978.1674974}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator IS - 10 SN - 0018-9340 SP945 EP950 EPD - 945-950 A1 - M.L. Griss, PY - 1978 KW - sparse polynomials KW - Inners KW - minor expansion KW - polynomial GCD KW - subresultants KW - sparse matrices VL - 27 JA - IEEE Transactions on Computers ER - | |||
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.
Index Terms:
sparse polynomials, Inners, minor expansion, polynomial GCD, subresultants, sparse matrices
Citation:
M.L. Griss, "Using an Efficient Sparse Minor Expansion Algorithm to Compute Polynomial Subresultants and the Greatest Common Denominator," IEEE Transactions on Computers, vol. 27, no. 10, pp. 945-950, Oct. 1978, doi:10.1109/TC.1978.1674974
Usage of this product signifies your acceptance of the Terms of Use.