On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
Journal of the ACM (JACM)
The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
Journal of the ACM (JACM)
A Comparison of Algorithms for the Exact Solution of Linear Equations
ACM Transactions on Mathematical Software (TOMS)
Polynomials and Linear Control Systems
Polynomials and Linear Control Systems
Algorithms for polynomials over a real algebraic number field.
Algorithms for polynomials over a real algebraic number field.
On computing polynomial GCDs in alternate bases
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
| Hi-index | 0.00 |
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.