Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
From MaRDI portal
Recommendations
- Algorithms for computing greatest common divisors of parametric multivariate polynomials
- Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials
- The computation of polynomial greatest common divisors over an algebraic number field
- The computation of polynomial greatest common divisors over an algebraic number field
- Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
- Greatest common divisor of parameter-dependent polynomials
- Publication:3476658
- An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
- Greatest common divisors of iterates of polynomials
- scientific article; zbMATH DE number 1263314
Cited in
(7)- A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases
- Algorithms for computing greatest common divisors of parametric multivariate polynomials
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
- Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials
- Parametric Euclidean algorithm
- An algorithm for computing greatest common right divisors of parametric Ore polynomials
- Computing the greatest common divisor of several parametric univariate polynomials via generalized subresultants
This page was built for publication: Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119959)