Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
From MaRDI portal
Publication:3597983
DOI10.1007/978-3-540-87827-8_7zbMath1166.68369OpenAlexW1830113820MaRDI QIDQ3597983
Nor'aini Aris, Shamsatun Nahar Ahmad
Publication date: 29 January 2009
Published in: Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87827-8_7
orthogonal polynomialsthree-term recurrence relationcomrade matrixgreatest common divisor of generalized polynomials
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Division of generalized polynomials using the comrade matrix
- A companion matrix analogue for orthogonal polynomials
- Greatest common divisor of generalized polynomials and polynomial matrices
- On computing polynomial GCDs in alternate bases
- A Comparison of Algorithms for the Exact Solution of Linear Equations
- The Computing Time of the Euclidean Algorithm
- The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors