scientific article; zbMATH DE number 6520834

MaRDI QIDQ3456475zbMATH OpenFDO

Authors Ján Eliaš, Jan Zítko

Publication date 14 December 2015

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

zbMATH Keywords

approximate greatest common divisorpolynomial greatest common divisorsingular valuestructured total least norm methodSylvester subresultant matrix

Mathematics Subject Classification ID

Solving polynomial systems; resultants (13P15)

Recommendations

• Greatest common divisor of parameter-dependent polynomials
• The numerical greatest common divisor of univariate polynomials
• A new view on the numerical computation of the greatest common divisor of two polynomials.
• scientific article; zbMATH DE number 3267423
• Greatest common divisors of iterates of polynomials
• Computing approximate greatest common right divisors of differential polynomials
• The calculation of the degree of an approximate greatest common divisor of two polynomials
• scientific article; zbMATH DE number 1263314
• 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.

Cited in

(9)

• When are two numerical polynomials relatively prime?
• QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
• Approximate polynomial GCD.
• Symbolic calculation of greatest common divisor of 2D polynomial matrices
• A new view on the numerical computation of the greatest common divisor of two polynomials.
• Approximate greatest common divisor of several polynomials from Hankel matrices
• Comparison of algorithms for calculation of the greatest common divisor of several polynomials.
• The calculation of the degree of an approximate greatest common divisor of two polynomials
• Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials

This page was built for publication:

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