Structured matrix methods computing the greatest common divisor of polynomials

DOI10.1515/spma-2017-0015zbMath1394.65035OpenAlexW2766835012MaRDI QIDQ1678991

Dimitrios Christou, Marilena Mitrouli, Dimitrios Triantafyllou

Publication date: 8 November 2017

Published in: Special Matrices (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/spma-2017-0015

zbMATH Keywords

singular value decompositionSylvester matrixQR decompositionBézout matrix

Mathematics Subject Classification ID

Related Items (1)

The computation of the degree of the greatest common divisor of three Bernstein basis polynomials

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial computations for blind image deconvolution
• The calculation of the degree of an approximate greatest common divisor of two polynomials
• Rank and null space calculations using matrix decomposition without column interchanges
• Approximate GCD and its application to ill-conditioned algebraic equations
• Linear multivariable control. A geometric approach
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices
• Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
• An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
• Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
• Structured Matrix Based Methods for Approximate Polynomial GCD
• Greatest common divisors from generalized sylvester resultant matrices
• 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
• Comparison of algorithms for calculation of g.c.d. of polynomials
• A New Version of the Euclidean Algorith
• On rank and null space computation of the generalized Sylvester matrix

This page was built for publication: Structured matrix methods computing the greatest common divisor of polynomials