## On the Computation of the GCD of 2-D Polynomials

The main contribution of this work is to provide an algorithm for the computation of the GCD of 2-D polynomials, based on DFT techniques. The whole theory is implemented via illustrative examples.

Show Summary Details# On the Computation of the GCD of 2-D Polynomials

#### Open Access

## On the Computation of the GCD of 2-D Polynomials

## About the article

In This Section# International Journal of Applied Mathematics and Computer Science

### Journal of University of Zielona Gora and Lubuskie Scientific Society

In This Section

4 Issues per year

IMPACT FACTOR 2016: 1.420

5-year IMPACT FACTOR: 1.597

CiteScore 2016: 1.81

SCImago Journal Rank (SJR) 2015: 1.025

Source Normalized Impact per Paper (SNIP) 2015: 1.674

Mathematical Citation Quotient (MCQ) 2015: 0.07

Panagiotis Tzekis / Nicholas Karampetakis / Haralambos Terzidis

The main contribution of this work is to provide an algorithm for the computation of the GCD of 2-D polynomials, based on DFT techniques. The whole theory is implemented via illustrative examples.

Keywords: greatest common divisor; discrete Fourier transform; two-variable polynomial

Karampetakis N. P., Tzekis P., (2005):

*On the computation of the minimal polynomial of a polynomial matrix.**International Journal of Applied Mathematics and Computer Science*, Vol. 15, No. 3, pp. 339-349.Karcanias N. and Mitrouli M., (2004):

*System theoretic based characterisation and computation of the least common multiple of a set of polynomials.**Linear Algebra and Its Applications*, Vol. 381, pp. 1-23.Karcanias N. and Mitrouli, M., (2000):

*Numerical computation of the least common multiple of a set of polynomials*,*Reliable Computing*, Vol. 6, No. 4, pp. 439-457.Karcanias N. and Mitrouli M., (1994):

*A matrix pencil based numerical method for the computation of the GCD of polynomials.**IEEE Transactions on Automatic Control*, Vol. 39, No. 5, pp. 977-981.Mitrouli M. and Karcanias N., (1993):

*Computation of the GCD of polynomials using Gaussian transformation and shifting.**International Journal of Control*, Vol. 58, No. 1, pp. 211-228.Noda M. and Sasaki T., (1991):

*Approximate GCD and its applications to ill-conditioned algebraic equations.**Journal of Computer and Applied Mathematics*Vol. 38, No. 1-3, pp. 335-351.Pace I. S. and Barnett S., (1973):

*Comparison of algorithms for calculation of GCD of polynomials.**International Journal of Systems Science*Vol. 4, No. 2, pp. 211-226.Paccagnella, L. E. and Pierobon, G. L., (1976):

*FFT calculation of a determinantal polynomial.**IEEE Transactions on Automatic Control*, Vol. 21, No. 3, pp. 401-402.Schuster, A. and Hippe, P., (1992):

*Inversion of polynomial matrices by interpolation.**IEEE Transactions on Automatic Control*, Vol. 37, No. 3, pp. 363-365.

**Published Online**: 2008-01-07

**Published in Print**: 2007-12-01

**Citation Information: **International Journal of Applied Mathematics and Computer Science, ISSN (Print) 1641-876X, DOI: https://doi.org/10.2478/v10006-007-0038-8. Export Citation

## Comments (0)