Exact GCD of integer polynomials

version 1.0.0.0 (2.32 KB) by Feng Cheng Chang
Exact GCD of a pair of polynomials is obtained by "elimination of leading polynomial coefficient"

1.1K Downloads

Updated Wed, 29 Oct 2008 11:45:00 +0000

View License

The polynomial GCD of two given polynomials can be found exactly if the polynomial coefficients are all integers.

The process involves only integer arithematic operations. The floating point errors may be completely eliminated.

The expected result is obtained by applying recurrently
"Elemination of leading coefficients of two equal-degree
polynomials." It is modified from "Monic polynomials subtraction," presented previously.

One of the main application is to factorize a integer polynomial with multiple roots.

Cite As

Feng Cheng Chang (2022). Exact GCD of integer polynomials (https://www.mathworks.com/matlabcentral/fileexchange/21934-exact-gcd-of-integer-polynomials), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R13
Compatible with any release
Platform Compatibility
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!