Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation

DOI10.1016/j.camwa.2006.01.010zbMath1134.65334MaRDI QIDQ2475938

Nicos Karcanias, Marilena Mitrouli, S. Fatouros, G. H. Halikias

Publication date: 11 March 2008

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2006.01.010

zbMATH Keywords

numerical examples; resultants; greatest common divisor; polynomials; factorisation; approximate computations

Mathematics Subject Classification ID

65D20: Computation of special functions and constants, construction of tables

13P05: Polynomials, factorization in commutative rings

Related Items

Generalised resultants, dynamic polynomial combinants and the minimal design problem, Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance, Approximate zero polynomials of polynomial matrices and linear systems, The computation of multiple roots of a polynomial, Approximate polynomial GCD over integers, The ERES method for computing the approximate GCD of several polynomials, Approximate polynomial GCD: small degree and small height perturbations, Numerical and Symbolical Methods for the GCD of Several Polynomials

Uses Software

• ERES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximate GCD and its application to ill-conditioned algebraic equations
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Grassmann invariants, almost zeros and the determinantal zero, pole assignment problems of linear multivariable systems
• Generalized Resultant Theorem
• A matrix pencil based numerical method for the computation of the GCD of polynomials
• Resultant properties of gcd of many polynomials and a factorization representation of gcd
• Computation of the GCD of polynomials using gaussian transformations and shifting