Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix

DOI10.1007/978-3-540-87827-8_7MaRDI QIDQ3597983zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Division of generalized polynomials using the comrade matrix
• Euclidean remainders for generalized polynomials
• On computing polynomial GCDs in alternate bases
• scientific article; zbMATH DE number 1574467
• A new recursive algorithm for inverting a general comrade matrix.

Cites work

• scientific article; zbMATH DE number 3839766 (Why is no real title available?)
• scientific article; zbMATH DE number 3846865 (Why is no real title available?)
• scientific article; zbMATH DE number 2034379 (Why is no real title available?)
• A Comparison of Algorithms for the Exact Solution of Linear Equations
• A companion matrix analogue for orthogonal polynomials
• Division of generalized polynomials using the comrade matrix
• Greatest common divisor of generalized polynomials and polynomial matrices
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On computing polynomial GCDs in alternate bases
• The Computing Time of the Euclidean Algorithm
• The Exact Solution of Systems of Linear Equations with Polynomial Coefficients

Cited in

(5)

• On linear-time solvers for comrade linear systems
• Division of generalized polynomials using the comrade matrix
• Numerical Analysis and Its Applications
• Symbolic algorithm for solving comrade linear systems based on a modified stair-diagonal approach
• Two algorithms for solving comrade linear systems

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)