A simple algorithm for GCD of polynomials
- 23 December 2022
- journal article
- Published by Peertechz Publications Private Limited in Annals of Mathematics and Physics
- Vol. 5 (2), 193-195
- https://doi.org/10.17352/amp.000065
Abstract
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.Keywords
This publication has 3 references indexed in Scilit:
- Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and controlJournal of Computational and Applied Mathematics, 2021
- Structured matrix-based methods for polynomial ∈-gcdPublished by Association for Computing Machinery (ACM) ,2007
- On Euclid's Algorithm and the Theory of SubresultantsJournal of the ACM, 1971