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

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

zbMATH Keywords

factorizationgreatest common divisorSylvester resultantcanonical resultant factorizationmatrix pencil computational procedures

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05)

Cited In (15)

• Nearest common root of a set of polynomials: a structured singular value approach
• Polynomial GCD derived through monic polynomial subtractions
• Numerical and Symbolical Methods for the GCD of Several Polynomials
• Invariance properties, and characterization of the greatest common divisor of a set of polynomials
• Computing nearby non-trivial Smith forms
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• Complex Roots of Quaternion Polynomials
• Structured matrix methods computing the greatest common divisor of polynomials
• The feedback invariant measures of distance to uncontrollability and unobservability
• Stability criteria of matrix polynomials
• The ERES method for computing the approximate GCD of several polynomials
• Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method
• 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
• Approximate zero polynomials of polynomial matrices and linear systems

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)