Division of generalized polynomials using the comrade matrix

DOI10.1016/0024-3795(84)90077-6zbMath0552.15003MaRDI QIDQ800983

Stephen Barnett

Publication date: 1984

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(84)90077-6

zbMATH Keywords

greatest common divisor; division; generalized polynomial; comrade matrix

Mathematics Subject Classification ID

13F20: Polynomial rings and ideals; rings of integer-valued polynomials

12D05: Polynomials in real and complex fields: factorization

15A21: Canonical forms, reductions, classification

Related Items

On the factorization and the inverse of a tridiagonal matrix, A novel elementary algorithm for solving comrade linear systems, Factorization of Hessenberg matrices, Euclidean remainders for generalized polynomials, Leverrier's algorithm for orthogonal polynomial bases, On linear-time solvers for comrade linear systems, Symbolic algorithm for solving comrade linear systems based on a modified stair-diagonal approach, An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials, Multiplication of Generalized Polynomials, with Applications to Classical Orthogonal Polynomials, Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis, Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix, Change of Basis for Products of Orthogonal Polynomials

Cites Work

• Congenial matrices
• A companion matrix analogue for orthogonal polynomials
• Greatest common divisor of two polynomials
• Unnamed Item