Computing the greatest common divisor of polynomials using the comrade matrix
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...
Main Authors: | Aris, Nor`Aini, Nahar Ahmad, Shamsatun |
---|---|
Format: | Book Section |
Published: |
Springer Verlag
2008
|
Subjects: |
Similar Items
-
Computing the greatest common divisor of polynomials using the comrade matrix /
by: Nor'Aini Aris, author, et al.
Published: (2007) -
Computation of the comrade matrix and the greatest common divisor of generalized polynomials /
by: Nor'aini Aris, author, et al.
Published: (2007) -
On the application of modular approach to the computation of the greatest common divisors of generalized polynomials
by: Aris, Nor'aini
Published: (2003) -
Numerical matrix methods in the computation of the greatest common divisor (GCD) of polynomials
by: Isa, S. N. A. B., et al.
Published: (2016) -
On the application of modular approach to the computation of the greatest common divisors of generalized polynomials /
by: Nor'aini Aris
Published: (2003)