On the Computation of the GCD of 2-D Polynomials

DOI10.2478/v10006-007-0038-8zbMath1229.68086OpenAlexW2035965809MaRDI QIDQ3089756

Panagiotis Tzekis, Haralambos K. Terzidis, Nicholas P. Karampetakis

Publication date: 25 August 2011

Published in: International Journal of Applied Mathematics and Computer Science (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/207851

zbMATH Keywords

greatest common divisordiscrete Fourier transformtwo-variable polynomial

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical interpolation (65D05) Numerical methods for discrete and fast Fourier transforms (65T50)

Related Items (2)

SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ On the computation of the inverse of a two-variable polynomial matrix by interpolation

Cites Work

• Unnamed Item
• Approximate GCD and its application to ill-conditioned algebraic equations
• System theoretic based characterisation and computation of the least common multiple of a set of polynomials.
• A matrix pencil based numerical method for the computation of the GCD of polynomials
• Computation of the GCD of polynomials using gaussian transformations and shifting
• Comparison of algorithms for calculation of g.c.d. of polynomials
• Numerical computation of the least common multiple of a set of polynomials

This page was built for publication: On the Computation of the GCD of 2-D Polynomials