The Mechanization of the Comrade Matrix Approach in Determining the GCD of Orthogonal Polynomials

Authors

  • Siti Nor Asiah Isa Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310 Johor Bahru, Johor, Malaysia
  • Nor’aini Aris UTM
  • Shazirawati Mohd Puzi UTM
  • Yeak Su Hoe UTM

DOI:

https://doi.org/10.11113/matematika.v34.n3.1136

Abstract

This paper revisits the comrade matrix approach in finding the greatest common divisor (GCD) of two orthogonal polynomials. The present work investigates on the applications of the QR decomposition with iterative refinement (QRIR) to solve certain systems of linear equations which is generated from the comrade matrix. Besides iterative refinement, an alternative approach of improving the conditioning behavior of the coefficient matrix by normalizing its columns is also considered. As expected the results reveal that QRIR is able to improve the solutions given by QR decomposition while the normalization of the matrix entries do improves the conditioning behavior of the coefficient matrix leading to a good approximate solutions of the GCD.

Downloads

Published

2018-12-31

How to Cite

Isa, S. N. A., Aris, N., Mohd Puzi, S., & Hoe, Y. S. (2018). The Mechanization of the Comrade Matrix Approach in Determining the GCD of Orthogonal Polynomials. MATEMATIKA: Malaysian Journal of Industrial and Applied Mathematics, 34(3), 25–32. https://doi.org/10.11113/matematika.v34.n3.1136