Computation of the GCD of polynomials using gaussian transformations and shifting

DOI10.1080/00207179308922998zbMATH Open0777.93053OpenAlexW2116318259MaRDI QIDQ5287932FDOQ5287932

Nicos Karcanias, Marilena Mitrouli

Publication date: 8 August 1993

Published in: International Journal of Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207179308922998

Recommendations

• Computation of approximate polynomial GCDs and an extension
• Computing approximate GCD of multivariate polynomials
• Numerical and symbolical methods for the GCD of several polynomials
• A subspace method for the computation of the GCD of polynomials
• On the computation of the GCD of 2-D polynomials
• Computing GCDs of polynomials over algebraic number fields
• On computing polynomial GCDs in alternate bases
• An iterative method for calculating approximate GCD of univariate polynomials
• Approximate GCD of multivariate polynomials
• DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS

zbMATH Keywords

numerical methodgreatest common divisor

Mathematics Subject Classification ID

Linear systems in control theory (93C05) Multivariable systems, multidimensional control systems (93C35)

Cites Work

• Matrix Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Invariance properties, and characterization of the greatest common divisor of a set of polynomials
• Rank and null space calculations using matrix decomposition without column interchanges
• A New Version of the Euclidean Algorith
• Generalized Resultant Theorem
• Comparison of algorithms for calculation of g.c.d. of polynomials

Cited In (22)

• 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
• Numerical and Symbolical Methods for the GCD of Several Polynomials
• Normal factorisation of polynomials and computational issues.
• Approximate polynomial GCD over integers
• Invariance properties, and characterization of the greatest common divisor of a set of polynomials
• Title not available (Why is that?)
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• Compound matrices: Properties, numerical issues and analytical computations
• Approximate least common multiple of several polynomials using the ERES division algorithm
• Structured matrix methods computing the greatest common divisor of polynomials
• The feedback invariant measures of distance to uncontrollability and unobservability
• 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
• On the Computation of the GCD of 2-D Polynomials
• Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method
• System theoretic based characterisation and computation of the least common multiple of a set of polynomials.
• Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance
• A Paper-and-Pencil gcd Algorithm for Gaussian Integers
• A compound matrix algorithm for the computation of the Smith form of a polynomial matrix
• On the zeros of blocked time-invariant systems
• Approximate zero polynomials of polynomial matrices and linear systems

This page was built for publication: Computation of the GCD of polynomials using gaussian transformations and shifting

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