Three new algorithms for multivariate polynomial GCD
From MaRDI portal
Publication:1194336
DOI10.1016/S0747-7171(08)80105-8zbMath0761.12005OpenAlexW2117535139MaRDI QIDQ1194336
Tateaki Sasaki, Masayuki Suzuki
Publication date: 27 September 1992
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80105-8
algorithmsGröbner basisgreatest common divisorsubresultantpolynomial remainder sequenceGCD of multivariate polynomialstruncated power series
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form ⋮ Algorithms for computing greatest common divisors of parametric multivariate polynomials ⋮ Algebraic-trigonometric Pythagorean-hodograph curves and their use for Hermite interpolation ⋮ A fast parallel sparse polynomial GCD algorithm ⋮ Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm ⋮ An improved EZ-GCD algorithm for multivariate polynomials ⋮ Factorization of polynomials given by arithmetic branching programs ⋮ Approximate eigenvalues, eigenvectors and inverse of a matrix with polynomial entries
Uses Software
Cites Work
- The EEZ-GCD algorithm
- The Subresultant PRS Algorithm
- Some algebraic algorithms based on head term elimination over polynomial rings
- Subresultants and Reduced Polynomial Remainder Sequences
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Three new algorithms for multivariate polynomial GCD
