تقرير
Simple algorithm for GCD of polynomials
| العنوان: | Simple algorithm for GCD of polynomials |
|---|---|
| المؤلفون: | Nardone, Pasquale, Sonnino, Giorgio |
| سنة النشر: | 2022 |
| المجموعة: | Computer Science |
| مصطلحات موضوعية: | Computer Science - Symbolic Computation |
| الوصف: | Based on the Bezout approach we propose a simple algorithm to determine the {\tt 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. Comment: 9 pages, 0 Figures |
| نوع الوثيقة: | Working Paper |
| الوصول الحر: | http://arxiv.org/abs/2201.06940Test |
| رقم الانضمام: | edsarx.2201.06940 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |