Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix

  • Nor’aini Aris
  • Shamsatun Nahar Ahmad
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5081)


The comrade matrix of a polynomial is an analogue of the companion matrix when the matrix is expressed in terms of a general basis such that the basis is a set of orthogonal polynomials satisfying the three-term recurrence relation. We present the algorithms for computing the comrade matrix, and the coefficient matrix of the corresponding linear systems derived from the recurrence relation. The computing times of these algorithms are analyzed. The computing time bounds, which dominate these times, are obtained as functions of the degree and length of the integers that represent the rational number coefficients of the input polynomials. The ultimate aim is to apply these computing time bounds in the analysis of the performance of the generalized polynomial greatest common divisor algorithms.


comrade matrix orthogonal polynomials three-term recurrence relation greatest common divisor of generalized polynomials 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Rahman, A.A., Aris, N.: The State of the art in Exact polynomial GCD computations. In: Proceedings Malaysian Science and Technology Conference (2002)Google Scholar
  2. 2.
    Rahman, A.A.: The use of GCD computation to remove repeated zeroes from a floating point polynomial. In: Proceedings SCAN 1992, Oldedenberg, Germany (1992)Google Scholar
  3. 3.
    Barnett, S.: A companion matrix analogue for orthogonal polynomials. Linear Algebra and its Applications 12, 197–208 (1975)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Barnett, S., Maroulas, J.: Greatest common divisor of generalized polynomial and polynomial matrices. Linear Algebra and its Applications 22, 195–210 (1978)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Barnett, S.: Polynomial and Linear Control Systems. Marcel Dekker, New York (1983)Google Scholar
  6. 6.
    Barnett, S.: Division of generalized polynomials using the comrade matrix. Linear Algebra and its Applications 60, 159–175 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Brown, W.S.: On Euclid’s algorithm and polynomial greatest common divisors  18(1), 478–504 (1971)Google Scholar
  8. 8.
    Collins, G.E.: The computing time of the Euclidean algorithm. SIAM Journal on Computing 3(1), 1–10 (1974)zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Collins, G.E., Mignotte, M., Winkler, F.: Arithmetic in basic algebraic domains: Computing Suppl.  4, 189–220 (1982)Google Scholar
  10. 10.
    Labahn, G., Cheng, H.: On computing polynomial GCDs in alternate bases. In: Proceedings ISSAC 2006, pp. 47–54 (2006)Google Scholar
  11. 11.
    McClellan, M.T.: The exact solution of systems of linear equations with polynomial coefficients. J. ACM 20(4), 563–588 (1973)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    McClellan, M.T.: A comparison of algorithms for the exact solutions of linear equations. ACM Trans. Math. Software 3(2), 147–158 (1977)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Aris, N., Rahman, A.A.: On the division of generalized polynomials. Lecture Notes Series On Computing, vol. 10, pp. 40–51. World Scientific Computing, Singapore (2003)Google Scholar
  14. 14.
    Rubald, C.M.: Algorithms for Polynomials over a Real Algebraic Number Field. University of Wisconsin: Ph.D. Thesis (1973)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Nor’aini Aris
    • 1
  • Shamsatun Nahar Ahmad
    • 1
  1. 1.Department of Mathematics, Faculty of ScienceUniversiti Teknologi MalaysiaMalaysia

Personalised recommendations