التفاصيل البيبلوغرافية
| العنوان: |
Simple algorithm for GCD of polynomials |
| المؤلفون: |
Nardone, Pasquale, Sonnino, Giorgio |
| سنة النشر: |
2022 |
| المجموعة: |
ArXiv.org (Cornell University Library) |
| مصطلحات موضوعية: |
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 |
| نوع الوثيقة: |
text |
| اللغة: |
unknown |
| العلاقة: |
http://arxiv.org/abs/2201.06940Test |
| الإتاحة: |
http://arxiv.org/abs/2201.06940Test |
| رقم الانضمام: |
edsbas.11138F9F |
| قاعدة البيانات: |
BASE |
