On computing polynomial GCDs in alternate bases

DOI10.1145/1145768.1145783zbMath1356.11090OpenAlexW2061723124MaRDI QIDQ2958970

Howard Cheng, George Labahn

Publication date: 3 February 2017

Published in: Proceedings of the 2006 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1145768.1145783

zbMATH Keywords

orthogonal polynomialssubresultantsEuclidean algorithmKrylov matricesfraction-free arithmetic

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Solving polynomial systems; resultants (13P15)

Related Items (2)

Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis ⋮ Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix

This page was built for publication: On computing polynomial GCDs in alternate bases