Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials

DOI10.1007/s10092-012-0053-5zbMath1261.12001OpenAlexW2065576924MaRDI QIDQ694553

Xin Lao, Madina Hasan, Winkler, Joab R.

Publication date: 12 December 2012

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10092-012-0053-5

zbMATH Keywords

greatest common divisorpolynomialsSylvester resultant matrix

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Numerical linear algebra (65F99)

Related Items

Polynomial computations for blind image deconvolution, The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials, A structure-preserving matrix method for the deconvolution of two Bernstein basis polynomials, A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials, The Sylvester Resultant Matrix and Image Deblurring, The computation of multiple roots of a polynomial, Overdetermined Weierstrass iteration and the nearest consistent system, The computation of the degree of the greatest common divisor of three Bernstein basis polynomials, Structured matrix methods for the computation of multiple roots of a polynomial, The Sylvester and Bézout resultant matrices for blind image deconvolution, The Computation of Multiple Roots of a Bernstein Basis Polynomial, Nearest common root of a set of polynomials: a structured singular value approach

Uses Software

• MultRoot

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The calculation of the degree of an approximate greatest common divisor of two polynomials
• A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
• Certified approximate univariate GCDs
• Common factor detection and estimation
• Polynomial Scaling
• Solving Polynomials with Small Leading Coefficients
• Computing multiple roots of inexact polynomials
• Approximate factorization of multivariate polynomials via differential equations
• The approximate GCD of inexact polynomials
• Modifications to the Garside, Jarratt & Mack Method for Solving Ill-conditioned Polynomial Equations