Polynomial GCD Derived through Monic Polynomial Subtractions
Author
Source
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-06-13
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
A simple and efficient algorithm for finding the GCD of a pair of univariate polynomials is derived.
The process requires only successive subtraction of two monic polynomials.
Amazingly, this approach gives the desired GCD for a pair of test polynomials of very high degree, such as (x+1)∧1000 and its derivative.
American Psychological Association (APA)
Chang, Feng Cheng. 2011. Polynomial GCD Derived through Monic Polynomial Subtractions. ISRN Applied Mathematics،Vol. 2011, no. 2011, pp.1-7.
https://search.emarefa.net/detail/BIM-492685
Modern Language Association (MLA)
Chang, Feng Cheng. Polynomial GCD Derived through Monic Polynomial Subtractions. ISRN Applied Mathematics No. 2011 (2011), pp.1-7.
https://search.emarefa.net/detail/BIM-492685
American Medical Association (AMA)
Chang, Feng Cheng. Polynomial GCD Derived through Monic Polynomial Subtractions. ISRN Applied Mathematics. 2011. Vol. 2011, no. 2011, pp.1-7.
https://search.emarefa.net/detail/BIM-492685
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-492685
