Euclidean remainders for generalized polynomials
From MaRDI portal
Publication:1108743
DOI10.1016/0024-3795(88)90128-0zbMath0654.65038MaRDI QIDQ1108743
Publication date: 1988
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(88)90128-0
Euclidean algorithm; linear congruences; comrade matrix; Euclidean remainders; greatest common divisor of polynomials; real polynomials in generalized form
12D05: Polynomials in real and complex fields: factorization
65H05: Numerical computation of solutions to single equations
Related Items
A unified approach to resultant matrices for Bernstein basis polynomials, Leverrier's algorithm for orthogonal polynomial bases, An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials, Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis
Cites Work