Invariance properties, and characterization of the greatest common divisor of a set of polynomials
From MaRDI portal
Publication:3470570
DOI10.1080/00207178708934007zbMath0695.12013MaRDI QIDQ3470570
Publication date: 1987
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207178708934007
greatest common divisor; shifting operation; elementary row operations on real matrices; extended-\({\mathbb{R}}\)-equivalence
15A23: Factorization of matrices
12D05: Polynomials in real and complex fields: factorization
12-04: Software, source code, etc. for problems pertaining to field theory
Related Items
Generalised resultants, dynamic polynomial combinants and the minimal design problem, Computation of the GCD of polynomials using gaussian transformations and shifting, Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance, Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies, Approximate least common multiple of several polynomials using the ERES division algorithm, Approximate zero polynomials of polynomial matrices and linear systems, The ERES method for computing the approximate GCD of several polynomials, Computation of approximate polynomial GCDs and an extension, Nearest common root of a set of polynomials: a structured singular value approach, Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials, Numerical and Symbolical Methods for the GCD of Several Polynomials
Cites Work
