Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix

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

zbMATH Keywords

orthogonal polynomialsthree-term recurrence relationcomrade matrixgreatest common divisor of generalized polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (1)

Symbolic algorithm for solving comrade linear systems based on a modified stair-diagonal approach

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

This page was built for publication: Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix