Three new algorithms for multivariate polynomial GCD (Q1194336): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q923626 |
||
| Property / reviewed by | |||
| Property / reviewed by: Q749610 / rank | |||
Revision as of 15:32, 21 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Three new algorithms for multivariate polynomial GCD |
scientific article |
Statements
Three new algorithms for multivariate polynomial GCD (English)
0 references
27 September 1992
0 references
Three algorithms for computing the GCD of multivariate polynomials are introduced. Based on the ideas presented by \textit{P. Gianni} and \textit{F. Trager} [Lect. Notes Comput. Sci. 204, 409-410 (1985)], the authors develop a different algorithm by calculating a Gröbner basis with a certain term ordering. The other two algorithms are developed based on the manipulation of some truncated power series. There are some comparisons with the currently existing GCD calculation algorithms given at the end of the paper.
0 references
GCD of multivariate polynomials
0 references
greatest common divisor
0 references
subresultant
0 references
polynomial remainder sequence
0 references
truncated power series
0 references
algorithms
0 references
Gröbner basis
0 references
