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

DOI10.1007/S10092-012-0053-5zbMATH Open1261.12001OpenAlexW2065576924MaRDI QIDQ694553FDOQ694553

Authors Madina Hasan, Xin Lao, Joab R. Winkler 

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

polynomialsSylvester resultant matrixgreatest common divisor

Mathematics Subject Classification ID

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

Recommendations

• The calculation of the degree of an approximate greatest common divisor of two polynomials
• Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials
• Approximate polynomial GCD.
• scientific article; zbMATH DE number 6520834
• Structured total least norm and approximate GCDs of inexact polynomials

Cites Work

• scientific article; zbMATH DE number 3839766 (Why is no real title available?)
• scientific article; zbMATH DE number 51361 (Why is no real title available?)
• scientific article; zbMATH DE number 1254251 (Why is no real title available?)
• scientific article; zbMATH DE number 953021 (Why is no real title available?)
• A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
• Approximate factorization of multivariate polynomials via differential equations
• Certified approximate univariate GCDs
• Common factor detection and estimation
• Computing multiple roots of inexact polynomials
• Modifications to the Garside, Jarratt & Mack Method for Solving Ill-conditioned Polynomial Equations
• Polynomial Scaling
• Solving Polynomials with Small Leading Coefficients
• Structured matrix-based methods for polynomial \(\varepsilon\)-gcd: analysis and comparisons
• The approximate GCD of inexact polynomials
• The calculation of the degree of an approximate greatest common divisor of two polynomials

Cited In (15)

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

Uses Software

• MultRoot

This page was built for publication: Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials

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