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

DOI10.1080/00207170310001628598zbMATH Open1043.93017OpenAlexW2142335183MaRDI QIDQ4454765FDOQ4454765

Authors S. Fatouros, Nicos Karcanias

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

factorizationgreatest common divisorSylvester resultantcanonical resultant factorizationmatrix pencil computational procedures

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05)

Recommendations

• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• Numerical Analysis and Its Applications
• scientific article; zbMATH DE number 30376
• scientific article; zbMATH DE number 1512700
• Structured matrix methods computing the greatest common divisor of polynomials

Cited in

(15)

• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
• The feedback invariant measures of distance to uncontrollability and unobservability
• Numerical and symbolical methods for the GCD of several polynomials
• Polynomial GCD derived through monic polynomial subtractions
• Complex roots of quaternion polynomials
• The ERES method for computing the approximate GCD of several polynomials
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• Generalised resultants, dynamic polynomial combinants and the minimal design problem
• Approximate zero polynomials of polynomial matrices and linear systems
• Structured matrix methods computing the greatest common divisor of polynomials
• Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method
• Stability criteria of matrix polynomials
• Invariance properties, and characterization of the greatest common divisor of a set of polynomials
• Nearest common root of a set of polynomials: a structured singular value approach
• Resultants and coprimeness of polynomials

This page was built for publication: Resultant properties of gcd of many polynomials and a factorization representation of gcd

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