Three new algorithms for multivariate polynomial GCD
type: Item
instance of: scholarly article
title: Three new algorithms for multivariate polynomial GCD
zbMATH Open document ID: 0761.12005
DOI: 10.1016/S0747-7171(08)80105-8
author: Tateaki Sasaki
author: Masayuki Suzuki
published in: Journal of Symbolic Computation
publication date: 1992-09-27T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 68W30
zbMATH DE Number: 64253
zbMATH Keywords: GCD of multivariate polynomials
zbMATH Keywords: greatest common divisor
zbMATH Keywords: subresultant
zbMATH Keywords: polynomial remainder sequence
zbMATH Keywords: truncated power series
zbMATH Keywords: algorithms
zbMATH Keywords: Gröbner basis
reviewed by: Joseph J. Liang
describes a project that uses: GCDHEU
describes a project that uses: REDUCE
MaRDI profile type: Publication
cites work: On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
cites work: The Subresultant PRS Algorithm
cites work: On Euclid's Algorithm and the Theory of Subresultants
cites work: Q3714165
cites work: Q3707405
cites work: Subresultants and Reduced Polynomial Remainder Sequences
cites work: Q4192968
cites work: Some algebraic algorithms based on head term elimination over polynomial rings
cites work: The EEZ-GCD algorithm
cites work: Q3851616
full work available at URL: s0747-7171(08)80105-8
OpenAlex ID: W2117535139
description: scientific article; zbMATH DE number 64253