A new view on the numerical computation of the greatest common divisor of two polynomials.

zbMATH Open1265.65087MaRDI QIDQ4902992FDOQ4902992

Authors: Jan Zítko 

Publication date: 18 January 2013

Recommendations

• scientific article; zbMATH DE number 6520834
• Structured matrix methods computing the greatest common divisor of polynomials
• Numerical Analysis and Its Applications
• Approximate polynomial GCD.
• Comparison of algorithms for calculation of the greatest common divisor of several polynomials.

zbMATH Keywords

Euclidean algorithmgreatest common divisorSylvester matrixstructured total least norm method

Mathematics Subject Classification ID

Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cited In (14)

• Title not available (Why is that?)
• On computation of the greatest common divisor of several polynomials over a finite field.
• Comparison of algorithms for calculation of the greatest common divisor of several polynomials.
• Title not available (Why is that?)
• A note on the Wolovich method of extraction of a greatest common divisor of two polynomial matrices
• A new method for computing polynomial greatest common divisors and polynomial remainder sequences
• Title not available (Why is that?)
• Symbolic calculation of greatest common divisor of 2D polynomial matrices
• On the remainders obtained in finding the greatest common divisor of two polynomials
• Numerical Analysis and Its Applications
• An algorithm for searching the greatest common divisor for Ore polynomials with polynomial coefficients depending on a parameter
• Structured matrix methods computing the greatest common divisor of polynomials
• An improvement of Euclid's algorithm.
• Title not available (Why is that?)

This page was built for publication: A new view on the numerical computation of the greatest common divisor of two polynomials.

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