Parametric Euclidean algorithm

MaRDI QIDQ5173855zbMATH OpenFDO

Authors Ali Ayad, Ali Fares, Youssef Ayyad

Publication date 16 February 2015

zbMATH Keywords

Euclidean algorithmgreatest common divisor of polynomialssymbolic computation

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Polynomials in number theory (11C08) Number-theoretic algorithms; complexity (11Y16) Symbolic computation and algebraic computation (68W30)

Recommendations

• Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials
• Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
• An Efficient Algorithm for Computing Parametric Multivariate Polynomial GCD
• Minors of Bezout matrices, subresultants and the parameterization of the degree of the polynomial greatest common divisor
• Algorithms for computing greatest common divisors of parametric multivariate polynomials

Cited in

(4)

• Greatest common divisor of parameter-dependent polynomials
• Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials
• scientific article; zbMATH DE number 1263314 (Why is no real title available?)
• An extended GCD algorithm for parametric univariate polynomials and application to parametric smith normal form

This page was built for publication: Parametric Euclidean algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5173855)