Algorithms for computing greatest common divisors of parametric multivariate polynomials
From MaRDI portal
Recommendations
- Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
- On the complexity of computing the greatest common divisor of several univariate polynomials
- Comparison of algorithms for calculation of the greatest common divisor of several polynomials.
- An algorithm for searching the greatest common divisor for Ore polynomials with polynomial coefficients depending on a parameter
- Parallel algorithms on greatest common divisor of polynomial system
- Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
- Computing approximate GCD of multivariate polynomials
- Greatest common divisor of parameter-dependent polynomials
- Computing approximate greatest common right divisors of differential polynomials
Cites work
- scientific article; zbMATH DE number 3900153 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 108068 (Why is no real title available?)
- scientific article; zbMATH DE number 1263314 (Why is no real title available?)
- A new algorithm for computing comprehensive Gröbner systems
- A new algorithm for discussing Gröbner bases with parameters.
- A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
- An efficient algorithm for computing a comprehensive Gröbner system of a parametric polynomial system
- Canonical comprehensive Gröbner bases
- Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials
- Computing in algebraic geometry. A quick start using SINGULAR
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On the computation of parametric Gröbner bases for modules and syzygies
- Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
- Stability conditions of monomial bases and comprehensive Gröbner systems
- The Structure of Polynomial Ideals and Gröbner Bases
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Three new algorithms for multivariate polynomial GCD
- Using Algebraic Geometry
- What can be computed in algebraic geometry?
Cited in
(13)- Parametric Euclidean algorithm
- Irreducibility and greatest common divisor algorithms for sparse polynomials
- Greatest common divisor of parameter-dependent polynomials
- A new method for computing polynomial greatest common divisors and polynomial remainder sequences
- An algorithm for computing greatest common right divisors of parametric Ore polynomials
- scientific article; zbMATH DE number 1253996 (Why is no real title available?)
- An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
- An algorithm for searching the greatest common divisor for Ore polynomials with polynomial coefficients depending on a parameter
- Analyzing the dual space of the saturated ideal of a regular set and the local multiplicities of its zeros
- An extended GCRD algorithm for parametric univariate polynomial matrices and application to parametric Smith form
- Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
- Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials
- On the complexity of computing the greatest common divisor of several univariate polynomials
This page was built for publication: Algorithms for computing greatest common divisors of parametric multivariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200294)
