On computing polynomial GCDs in alternate bases

DOI10.1145/1145768.1145783MaRDI QIDQ2958970zbMATH OpenOpenAlexFDO

Authors Howard Cheng, G. 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

Euclidean algorithmorthogonal polynomialssubresultantsKrylov matricesfraction-free arithmetic

Mathematics Subject Classification ID

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

Recommendations

• A subresultant based subspace method for the computation of polynomial GCDs
• scientific article; zbMATH DE number 1303539
• Structured matrix methods computing the greatest common divisor of polynomials
• Numerical Analysis and Its Applications
• Computing GCDs of polynomials over algebraic number fields

Cited in

(6)

• Basis-Independent Polynomial Division Algorithm Applied to Division in Lagrange and Bernstein Basis
• Computing GCDs of polynomials over algebraic number fields
• Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix
• Computation of the GCD of polynomials using gaussian transformations and shifting
• scientific article; zbMATH DE number 2034379 (Why is no real title available?)
• Subresultants of several univariate polynomials in Newton basis

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958970)