Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
From MaRDI portal
Publication:3597983
DOI10.1007/978-3-540-87827-8_7zbMATH Open1166.68369OpenAlexW1830113820MaRDI QIDQ3597983FDOQ3597983
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
Recommendations
orthogonal polynomialsthree-term recurrence relationcomrade matrixgreatest common divisor of generalized polynomials
Cites Work
- Division of generalized polynomials using the comrade matrix
- Title not available (Why is that?)
- The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
- A companion matrix analogue for orthogonal polynomials
- The Computing Time of the Euclidean Algorithm
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Greatest common divisor of generalized polynomials and polynomial matrices
- A Comparison of Algorithms for the Exact Solution of Linear Equations
- On computing polynomial GCDs in alternate bases
Cited In (4)
This page was built for publication: Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597983)