Analysis and comparison of numerical algorithms for finding the GCD of certain types of polynomials in the Chebyshev basis

• المؤلفون الرئيسيون: Isa, S. N. A., Aris, N., Mohd. Taha, A. Z. S.
• التنسيق: مقال
• منشور في: Penerbit UTM Press 2017
• الموضوعات: QA Mathematics
• الوصول للمادة أونلاين: http://eprints.utm.my/id/eprint/80919/; http://dx.doi.org/10.11113/mjfas.v13n2.603
• المؤسسة: Universiti Teknologi Malaysia

This research investigates on the numerical methods for computing the greatest common divisors (GCD) of two polynomials in the orthogonal basis without having to convert to the power series form. Previous implementations were conducted using the Gauss Elimination with partial pivoting (GEPP) and QR...