Exact GCD of integer polynomials
Updated Wed, 29 Oct 2008 11:45:00 +0000
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.
Feng Cheng Chang (2023). 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
Platform CompatibilityWindows macOS Linux
- MATLAB > Mathematics > Elementary Math > Polynomials >
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!
Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.