On the Computation of the GCD of 2-D Polynomials

Panagiotis Tzekis; Nicholas Karampetakis; Haralambos Terzidis

doi:10.2478/v10006-007-0038-8

.blurhash-client-img { display: none !important; }

On the Computation of the GCD of 2-D Polynomials

International Journal of Applied Mathematics and Computer Science

Volume 17 (2007): Issue 4 (December 2007)

By: Panagiotis Tzekis, Nicholas Karampetakis and Haralambos Terzidis

Open Access

|Jan 2008

Abstract

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.

References

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.
Search in Google Scholar
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.10.1016/j.laa.2003.11.009
Search in Google Scholar
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.
Search in Google Scholar
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.10.1109/9.284874
Search in Google Scholar
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.10.1080/00207179308922998
Search in Google Scholar
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.
Search in Google Scholar
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.10.1080/00207727308920007
Search in Google Scholar
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.10.1109/TAC.1976.1101226
Search in Google Scholar
Schuster, A. and Hippe, P., (1992): Inversion of polynomial matrices by interpolation.IEEE Transactions on Automatic Control, Vol. 37, No. 3, pp. 363-365.10.1109/9.119638
Search in Google Scholar

Articles in this issue

DOI: https://doi.org/10.2478/v10006-007-0038-8 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X

Journal RSS Feed

Language: English

Page range: 463 - 470

Published on: Jan 7, 2008

Published by: University of Zielona Góra

In partnership with: Paradigm Publishing Services

Publication frequency: 4 issues per year

Keywords:

greatest common divisor,

discrete Fourier transform,

two-variable polynomial

Related subjects:

Mathematics,

Applied mathematics

© 2008 Panagiotis Tzekis, Nicholas Karampetakis, Haralambos Terzidis, published by University of Zielona Góra
This work is licensed under the Creative Commons License.

Volume 17 (2007): Issue 4 (December 2007)