Nardone Pasquale, Sonnino Giorgio, "Simple Algorithm for GCD of Polynomials," WSEAS Transactions on Mathematics, vol. 21, pp. 869-871, 2022, DOI:10.37394/23206.2022.21.99
Nardone Pasquale, Sonnino Giorgio. Simple Algorithm for GCD of Polynomials.
WSEAS Transactions on Mathematics. 2022;21:869-871. 10.37394/23206.2022.21.99
WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 21, 2022
Simple Algorithm for GCD of Polynomials
Authors: ,
Abstract: Based on the Bezout approach we propose a simple algorithm to determine the gcd of two polynomials which doesn’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 nor determinant calculation.
Pages: 869-871 WSEAS Transactions on Mathematics, ISSN / E-ISSN: 1109-2769 / 2224-2880, Volume 21, 2022, Art. #99 DOI: 10.37394/23206.2022.21.99
×
Citation Tools