Resultant properties of gcd of many polynomials and a factorization representation of gcd

DOI10.1080/00207170310001628598zbMath1043.93017MaRDI QIDQ4454765

Nicos Karcanias, S. Fatouros

Publication date: 8 March 2004

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207170310001628598

zbMATH Keywords

greatest common divisor; factorization; Sylvester resultant; canonical resultant factorization; matrix pencil computational procedures

Mathematics Subject Classification ID

13P05: Polynomials, factorization in commutative rings

Related Items

Complex Roots of Quaternion Polynomials, Generalised resultants, dynamic polynomial combinants and the minimal design problem, Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance, Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method, Approximate zero polynomials of polynomial matrices and linear systems, The ERES method for computing the approximate GCD of several polynomials, Structured matrix methods computing the greatest common divisor of polynomials, Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation, Numerical and Symbolical Methods for the GCD of Several Polynomials