Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance

The computation of the greatest common divisor (GCD) of several polynomials is a problem that emerges in many fields of applications. The GCD computation has a non-generic nature and thus its numerical computation is a hard problem. In this paper we examine the family of matrix pencil methods for GCD computation and investigate their performance as far as their complexity, error analysis and their effectiveness for evaluating approximate solutions. The relative merits of the various variants of such methods are examined for the different cases of sets of polynomials with varying number of elements and degree. The developed algorithms combine symbolical and numerical programming and this is what we define here as hybrid computations. The combination of numerical operations with symbolical programming can improve the nature of the methods and guarantees the stability of the algorithm. Furthermore, it emphasizes the significance of hybrid computations in complex problems such as the computation of GCD. All methods are tested thoroughly for several sets of polynomials and the results are presented in tables.

[1]  D. Bertsekas,et al.  A Vector Space Approach to Models and Optimization , 1983 .

[2]  Nicos Karcanias,et al.  Resultant properties of gcd of many polynomials and a factorization representation of gcd , 2003 .

[3]  L. Trefethen,et al.  Numerical linear algebra , 1997 .

[4]  Antonis I. G. Vardulakis,et al.  Generalized Resultant Theorem , 1978 .

[5]  W. Blankinship.  A New Version of the Euclidean Algorith , 1963 .

[6]  Zhonggang Zeng,et al.  A Rank-Revealing Method with Updating, Downdating, and Applications , 2005, SIAM J. Matrix Anal. Appl..

[7]  N. Karcanias,et al.  A matrix pencil based numerical method for the computation of the GCD of polynomials , 1994, IEEE Trans. Autom. Control..

[8]  S. Barnett,et al.  Greatest common divisor of two polynomials , 1970 .

[9]  Stephen Barnett,et al.  Comparison of algorithms for calculation of g.c.d. of polynomials , 1973 .

[10]  Narendra Karmarkar,et al.  Approximate polynomial greatest common divisors and nearest singular polynomials , 1996, ISSAC '96.

[11]  Arnold Schönhage,et al.  Quasi-GCD computations , 1985, J. Complex..

[12]  Robert M. Corless,et al.  Optimization strategies for the approximate GCD problem , 1998, ISSAC '98.

[13]  Marilena Mitrouli,et al.  Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation , 2006, Comput. Math. Appl..

[14]  Matu-Tarow Noda,et al.  Approximate GCD and its application to ill-conditioned algebraic equations , 1991 .

[15]  Gene H. Golub,et al.  Matrix computations , 1983 .

[16]  S. Barnett,et al.  Greatest common divisor of several polynomials , 1971, Mathematical Proceedings of the Cambridge Philosophical Society.

[17]  N. Karcanias,et al.  Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies , 1996 .

[18]  J. Pearson.  Linear multivariable control, a geometric approach , 1977 .

[19]  N. Karcanias,et al.  Computation of the GCD of polynomials using gaussian transformations and shifting , 1993 .

[20]  N. Karcanias.  Invariance properties, and characterization of the greatest common divisor of a set of polynomials , 1987 .

[21]  C. Nelson Dorny,et al.  A Vector Space Approach to Models and Optimization , 1983 .

[22]  E. Ecer,et al.  Numerical Linear Algebra and Applications , 1995, IEEE Computational Science and Engineering.

[23]  Nicos Karcanias,et al.  Almost zeros of a set of polynomials of R[s] , 1983 .

[24]  M. Hirsch,et al.  Differential Equations, Dynamical Systems, and Linear Algebra , 1974 .

[25]  Yingbo Hua,et al.  A subspace method for the computation of the GCD of polynomials , 1997, Autom..