Table of Contents
ISRN Applied Mathematics
Volume 2011 (2011), Article ID 714102, 7 pages
http://dx.doi.org/10.5402/2011/714102
Research Article

Polynomial GCD Derived through Monic Polynomial Subtractions

Allwave Corporation, 3860 Del Amo Boulevard, No. 404, Torrance, CA 90503, USA

Received 10 March 2011; Accepted 19 April 2011

Academic Editors: E. Kita and F. Lebon

Copyright © 2011 Feng Cheng Chang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Z. Zeng, “Computing multiple roots of inexact polynomials,” Mathematics of Computation, vol. 74, no. 250, pp. 869–903, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  2. C. D. Yan and W. H. Chieng, “Method for finding multiple roots of polynomials,” Computers & Mathematics with Applications, vol. 51, no. 3-4, pp. 605–620, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  3. F. C. Chang, “Solving multiple-root polynomials,” IEEE Antennas and Propagation Magazine, vol. 51, no. 6, pp. 151–155, 2009. View at Publisher · View at Google Scholar
  4. W. S. Brown and J. F. Traub, “On Euclid's algorithm and the theory of subresultants,” Journal of the ACM, vol. 14, no. 1, pp. 128–142, 1967. View at Google Scholar
  5. A. Terui, “Recursive polynomial remainder sequence and its subresultants,” Journal of Algebra, vol. 320, no. 2, pp. 633–659, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH