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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book Section |
| Published: |
Springer Verlag
2008
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/12519/ http://dx.doi.org/10.1007/978-3-540-87827-8_7 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Teknologi Malaysia |
Be the first to leave a comment!