A simple algorithm for GCD of polynomials
<p>Based on the Bezout approach we propose a simple algorithm to determine the gcd of two polynomials that don't need division, like the Euclidean algorithm, or determinant calculations, like the Sylvester matrix algorithm. The algorithm needs only n steps for polynomials of degree n. For...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Published: |
Annals of Mathematics and Physics - Peertechz Publications,
2022-12-23.
|
| Subjects: | |
| Online Access: | Connect to this object online. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | <p>Based on the Bezout approach we propose a simple algorithm to determine the gcd of two polynomials that don't need division, like the Euclidean algorithm, or determinant calculations, like the Sylvester matrix algorithm. The algorithm needs only n steps for polynomials of degree n. Formal manipulations give the discriminant or the resultant for any degree without needing division or determinant calculation. </p> |
|---|---|
| DOI: | 10.17352/amp.000065 |