Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm (Q689905): Difference between revisions

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.