Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance

DOI10.1080/00207170600725701zbMath1125.65041OpenAlexW2140382237MaRDI QIDQ5423857

Dimitrios Triantafyllou, Nicos Karcanias, Marilena Mitrouli

Publication date: 31 October 2007

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

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

zbMATH Keywords

algorithmsstabilitynumerical examplesgreatest common divisorerror analysispolynomialsmatrix pencil methodssymbolical programming

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials in number theory (11C08) Numerical computation of solutions to single equations (65H05) Algebraic number theory computations (11Y40) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items

Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ Blind image deconvolution using a banded matrix method ⋮ The computation of multiple roots of a polynomial ⋮ Special issue on the use of computer algebra systems for computer aided control system design ⋮ Nearest common root of a set of polynomials: a structured singular value approach ⋮ Variable projection methods for approximate (greatest) common divisor computations

Cites Work

• Unnamed Item
• Rang revealing QR factorizations
• Quasi-gcd computations
• Approximate GCD and its application to ill-conditioned algebraic equations
• A subspace method for the computation of the GCD of polynomials
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• Invariance properties, and characterization of the greatest common divisor of a set of polynomials
• Generalized Resultant Theorem
• A matrix pencil based numerical method for the computation of the GCD of polynomials
• Resultant properties of gcd of many polynomials and a factorization representation of gcd
• Computation of the GCD of polynomials using gaussian transformations and shifting
• A Rank-Revealing Method with Updating, Downdating, and Applications
• Comparison of algorithms for calculation of g.c.d. of polynomials
• A New Version of the Euclidean Algorith
• Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies

This page was built for publication: Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance