Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm (Q689905)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm |
scientific article; zbMATH DE number 446760
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm |
scientific article; zbMATH DE number 446760 |
Statements
Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm (English)
0 references
29 September 1994
0 references
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.
0 references
polynomial GCD
0 references
polynomial remainder sequence
0 references
multivariable polynomials
0 references
