Resultant properties of gcd of many polynomials and a factorization representation of gcd
From MaRDI portal
Publication:4454765
DOI10.1080/00207170310001628598zbMath1043.93017OpenAlexW2142335183MaRDI QIDQ4454765
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
greatest common divisorfactorizationSylvester resultantcanonical resultant factorizationmatrix pencil computational procedures
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ Structured matrix methods computing the greatest common divisor of polynomials ⋮ Approximate zero polynomials of polynomial matrices and linear systems ⋮ Computing nearby non-trivial Smith forms ⋮ Complex Roots of Quaternion Polynomials ⋮ Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method ⋮ Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation ⋮ The ERES method for computing the approximate GCD of several polynomials ⋮ Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance ⋮ Stability criteria of matrix polynomials ⋮ Nearest common root of a set of polynomials: a structured singular value approach ⋮ Generalised resultants, dynamic polynomial combinants and the minimal design problem ⋮ The feedback invariant measures of distance to uncontrollability and unobservability
This page was built for publication: Resultant properties of gcd of many polynomials and a factorization representation of gcd
