Approximate polynomial GCD.

MaRDI QIDQ3456448zbMATH OpenFDO

Authors Ján Eliaš, Jan Zítko

Publication date 14 December 2015

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

zbMATH Keywords

approximate greatest common divisorpolynomial greatest common divisorsingular valueSylvester subresultant matrixtotal least squares problem

Mathematics Subject Classification ID

Solving polynomial systems; resultants (13P15) Numerical approximation and computational geometry (primarily algorithms) (65D99)

Recommendations

• scientific article; zbMATH DE number 6520834
• Structured total least norm and approximate GCDs of inexact polynomials
• Structured matrix based methods for approximate polynomial GCD
• Certified approximate univariate GCDs
• scientific article; zbMATH DE number 5168246

Cited in

(17)

• Robust estimation of GCD with sparse coefficients
• When are two numerical polynomials relatively prime?
• Computation of approximate polynomial GCDs and an extension
• Computing approximate greatest common right divisors of differential polynomials
• Approximate gcds of polynomials and sparse SOS relaxations
• An ODE-based method for computing the approximate greatest common divisor of polynomials
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• Structured total least norm and approximate GCDs of inexact polynomials
• QR-factorization method for computing the greatest common divisor of polynomials with inexact coefficients
• An improvement in the lattice construction process of approximate polynomial GCD over integers
• Structured matrix based methods for approximate polynomial GCD
• The numerical greatest common divisor of univariate polynomials
• A new view on the numerical computation of the greatest common divisor of two polynomials.
• Approximate GCD in Bernstein basis
• Approximate Polynomial gcd: Small Degree and Small Height Perturbations
• 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: Approximate polynomial GCD.

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