On the Relation Between Matrices and the Greatest Common Divisor of Polynomials

DOI10.1007/978-3-319-26520-9_20OpenAlexW2290207640MaRDI QIDQ3304778

Nikolai L. Manev

Publication date: 3 August 2020

Published in: Large-Scale Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26520-9_20

zbMATH Keywords

Gauss eliminationgreatest common divisor of polynomialsreduced row echelon form

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites Work

• Unnamed Item
• Greatest common divisor of two polynomials
• An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
• Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
• Another Theorem Relating Sylvester's Matrix and the Greatest Common Divisor
• Some Applications of Matrics in the Theory of Equations

This page was built for publication: On the Relation Between Matrices and the Greatest Common Divisor of Polynomials