Author:
Tzekis Panagiotis,Karampetakis Nicholas,Terzidis Haralambos
Abstract
On the Computation of the GCD of 2-D PolynomialsThe 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.
Subject
Applied Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference9 articles.
1. On the computation of the minimal polynomial of a polynomial matrix;N. Karampetakis;International Journal of Applied Mathematics and Computer Science,2005
2. System theoretic based characterisation and computation of the least common multiple of a set of polynomials;N. Karcanias;Linear Algebra and Its Applications,2004
3. Numerical computation of the least common multiple of a set of polynomials;N. Karcanias;Reliable Computing,2000
4. A matrix pencil based numerical method for the computation of the GCD of polynomials;N. Karcanias;IEEE Transactions on Automatic Control,1994
5. Computation of the GCD of polynomials using Gaussian transformation and shifting;M. Mitrouli;International Journal of Control,1993
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献