Invariance properties, and characterization of the greatest common divisor of a set of polynomials
From MaRDI portal
Publication:3470570
DOI10.1080/00207178708934007zbMath0695.12013OpenAlexW2059557631MaRDI 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 divisorshifting operationelementary row operations on real matricesextended-\({\mathbb{R}}\)-equivalence
Factorization of matrices (15A23) Polynomials in real and complex fields: factorization (12D05) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items (11)
Computation of the GCD of polynomials using gaussian transformations and shifting ⋮ Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ 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 ⋮ 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 ⋮ Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials ⋮ Nearest common root of a set of polynomials: a structured singular value approach ⋮ Generalised resultants, dynamic polynomial combinants and the minimal design problem ⋮ Computation of approximate polynomial GCDs and an extension
Cites Work
This page was built for publication: Invariance properties, and characterization of the greatest common divisor of a set of polynomials
