Abd. Rahman, Ali and Aris, Nor'Aini
(2007)
*Development of symbolic algorithms for certain algebraic processes.*
Documentation.
Universiti Teknologi Malaysia.
(Unpublished)

PDF
309kB |

Official URL: https://www.researchgate.net/publication/279488455...

## Abstract

This study investigates the problem of computing the exact greatest common divisor of two polynomials relative to an orthogonal basis, defined over the rational number field. The main objective of the study is to design and implement an effective and efficient symbolic algorithm for the general class of dense polynomials, given the rational number defining terms of their basis. From a general algorithm using the comrade matrix approach, the nonmodular and modular techniques are prescribed. If the coefficients of the generalized polynomials are multiprecision integers, multiprecision arithmetic will be required in the construction of the comrade matrix and the corresponding systems coefficient matrix. In addition, the application of the nonmodular elimination technique on this coefficient matrix extensively applies multiprecision rational number operations. The modular technique is employed to minimize the complexity involved in such computations. A divisor test algorithm that enables the detection of an unlucky reduction is a crucial device for an effective implementation of the modular technique. With the bound of the true solution not known a priori, the test is devised and carefully incorporated into the modular algorithm. The results illustrate that the modular algorithm illustrate its best performance for the class of relatively prime polynomials. The empirical computing time results show that the modular algorithm is markedly superior to the nonmodular algorithms in the case of sufficiently dense Legendre basis polynomials with a small GCD solution. In the case of dense Legendre basis polynomials with a big GCD solution, the modular algorithm is significantly superior to the nonmodular algorithms in higher degree polynomials. For more definitive conclusions, the computing time functions of the algorithms that are presented in this report have been worked out. Further investigations have also been suggested.

Item Type: | Monograph (Documentation) |
---|---|

Uncontrolled Keywords: | problem of computing; efficient symbolic algorithm; modular technique |

Subjects: | Q Science > QA Mathematics |

Divisions: | Science |

ID Code: | 2677 |

Deposited By: | Nor Azlin Nordin |

Deposited On: | 21 May 2007 07:47 |

Last Modified: | 11 Oct 2017 00:57 |

Repository Staff Only: item control page