Aris, Nor`Aini and Nahar Ahmad, Shamsatun (2008) Computing the greatest common divisor of polynomials using the comrade matrix. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag, Germany, 87-96 . ISBN 978-354087826-1
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/978-3-540-87827-8_7
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.
|Item Type:||Book Section|
|Additional Information:||ISBN:978-354087826-1; 8th Asian Symposium on Computer Mathematics, ASCM 2007; 15 December 2007 through 17 December 2007|
|Uncontrolled Keywords:||comrade matrix, greatest common divisor of generalized polynomials, orthogonal polynomials, three-term recurrence relation|
|Subjects:||Q Science > QA Mathematics|
|Deposited By:||Liza Porijo|
|Deposited On:||07 Jun 2011 10:14|
|Last Modified:||07 Jun 2011 10:14|
Repository Staff Only: item control page