Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
From MaRDI portal
Publication:694553
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
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
- Structured total least norm and approximate GCDs of inexact polynomials
Numerical linear algebra (65F99) Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10)
Cites Work
- Title not available (Why is that?)
- Solving Polynomials with Small Leading Coefficients
- Certified approximate univariate GCDs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate factorization of multivariate polynomials via differential equations
- The approximate GCD of inexact polynomials
- Structured matrix-based methods for polynomial \(\varepsilon\)-gcd: analysis and comparisons
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
- Polynomial Scaling
- Computing multiple roots of inexact polynomials
- Title not available (Why is that?)
- The calculation of the degree of an approximate greatest common divisor of two polynomials
- Common factor detection and estimation
- Modifications to the Garside, Jarratt & Mack Method for Solving Ill-conditioned Polynomial Equations
Cited In (14)
- The Computation of Multiple Roots of a Bernstein Basis Polynomial
- 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
- 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
Uses Software
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)
