Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm
From MaRDI portal
In calculating the GCD of multivariable polynomials one can simplify the calculation by truncating the higher powers of variables other than the main one. There is a theoretical bound for the powers to be used, but the author proposes a smaller ``practical bound, that speeds up the calculation. There are occasions when the practical bound is too small for the method to work, and it is described how to overcome this difficulty. Timings of various methods are given in tables.
Recommendations
Cites work
- scientific article; zbMATH DE number 3913669 (Why is no real title available?)
- scientific article; zbMATH DE number 3936514 (Why is no real title available?)
- scientific article; zbMATH DE number 3631929 (Why is no real title available?)
- scientific article; zbMATH DE number 3026247 (Why is no real title available?)
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- On Hensel factorization. I
- Polynomial Remainder Sequences and Determinants
- The EEZ-GCD algorithm
- The Subresultant PRS Algorithm
- Three new algorithms for multivariate polynomial GCD
Cited in
(2)
This page was built for publication: Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689905)
