Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm
type: Item
instance of: scholarly article
title: Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm
zbMATH Open document ID: 0796.12007
DOI: 10.1007/BF03167202
author: Masayuki Suzuki
published in: Japan Journal of Industrial and Applied Mathematics
publication date: 1994-09-29T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 12Y05
Mathematics Subject Classification ID: 11Y99
zbMATH DE Number: 446760
zbMATH Keywords: polynomial GCD
zbMATH Keywords: polynomial remainder sequence
zbMATH Keywords: multivariable polynomials
reviewed by: H. J. Godwin
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: Q3707405
cites work: Polynomial Remainder Sequences and Determinants
cites work: Q4192968
cites work: Q3690211
cites work: Three new algorithms for multivariate polynomial GCD
cites work: Q5766357
cites work: The EEZ-GCD algorithm
cites work: On Hensel factorization. I
description: scientific article; zbMATH DE number 446760