Invariance properties, and characterization of the greatest common divisor of a set of polynomials

DOI10.1080/00207178708934007zbMATH Open0695.12013OpenAlexW2059557631MaRDI QIDQ3470570FDOQ3470570

Authors: Nicos Karcanias 

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

Recommendations

• Publication:3476658
• Computation of the GCD of polynomials using gaussian transformations and shifting
• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• Resultant properties of gcd of many polynomials and a factorization representation of gcd

zbMATH Keywords

greatest common divisorshifting operationelementary row operations on real matricesextended-\({\mathbb{R}}\)-equivalence

Mathematics Subject Classification ID

Factorization of matrices (15A23) Polynomials in real and complex fields: factorization (12D05) Software, source code, etc. for problems pertaining to field theory (12-04)

Cites Work

• Title not available (Why is that?)
• Greatest common divisor via generalized Sylvester and Bezout matrices
• Generalized Resultant Theorem

Cited In (13)

• 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
• Computation of approximate polynomial GCDs and an extension
• Title not available (Why is that?)
• Approximate least common multiple of several polynomials using the ERES division algorithm
• Computation of the GCD of polynomials using gaussian transformations and shifting
• Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies
• The ERES method for computing the approximate GCD of several polynomials
• Special isomorphisms of \(F[x_{1},\ldots ,x_{n}]\) preserving GCD and their use.
• 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
• Numerical and symbolical methods for the GCD of several polynomials
• Approximate zero polynomials of polynomial matrices and linear systems

This page was built for publication: Invariance properties, and characterization of the greatest common divisor of a set of polynomials

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