Greatest common divisor of parameter-dependent polynomials

MaRDI QIDQ1898593zbMATH OpenFDO

Authors K. Yu. Kvashenko, S. A. Abramov

Publication date 25 September 1995

Published in Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

zbMATH Keywords

computer algebrafast algorithmgreatest common divisorparameter-dependent polynomials

Mathematics Subject Classification ID

Polynomials in real and complex fields: factorization (12D05) Numerical computation of solutions to single equations (65H05)

Recommendations

• scientific article; zbMATH DE number 1263314
• An algorithm for searching the greatest common divisor for Ore polynomials with polynomial coefficients depending on a parameter
• Algorithms for computing greatest common divisors of parametric multivariate polynomials
• Parametric Euclidean algorithm
• Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials

Cited in

(7)

• Algorithms for computing greatest common divisors of parametric multivariate polynomials
• Common Divisors of Solvable Polynomials in JAS
• scientific article; zbMATH DE number 6520834 (Why is no real title available?)
• scientific article; zbMATH DE number 1263314 (Why is no real title available?)
• On the Greatest Common Divisor of the Value of Two Polynomials
• Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
• An algorithm for searching the greatest common divisor for Ore polynomials with polynomial coefficients depending on a parameter

This page was built for publication: Greatest common divisor of parameter-dependent polynomials

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