An improvement of Euclid's algorithm.

MaRDI QIDQ3456436zbMATH OpenFDO

Authors Jan Kuřátko, Jan Zítko

Publication date 14 December 2015

Full work available at URL http://hdl.handle.net/10338.dmlcz/702765

zbMATH Keywords

Euclid's algorithmgreatest common divisorSylvester matrix

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Polynomials, factorization in commutative rings (13P05)

Recommendations

• A new view on the numerical computation of the greatest common divisor of two polynomials.
• scientific article; zbMATH DE number 15442
• Numerical Analysis and Its Applications
• scientific article; zbMATH DE number 480305
• Euclid's algorithm, Guass' elimination and Buchberger's algorithm

This page was built for publication: An improvement of Euclid's algorithm.

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