The ERES method for computing the approximate GCD of several polynomials

DOI10.1016/J.APNUM.2009.10.002zbMath1185.12005OpenAlexW2066692963MaRDI QIDQ969304

Nicos Karcanias, Dimitrios Christou, Marilena Mitrouli

Publication date: 6 May 2010

Published in: Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: http://openaccess.city.ac.uk/id/eprint/14042/1/%28213%29%20APNUM_Eres%20GCD%20%20Rev.pdf

zbMATH Keywords

Gaussian eliminationapproximate greatest common divisorsymbolic-numeric computationspartial SVD

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Nonlinear algebraic or transcendental equations (65H99)

Related Items (9)

Approximate least common multiple of several polynomials using the ERES division algorithm ⋮ On the zeros of blocked time-invariant systems ⋮ Approximate zero polynomials of polynomial matrices and linear systems ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Toward the best algorithm for approximate GCD of univariate polynomials ⋮ A hybrid method for computing the intersection and tangency points of plane curves ⋮ Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials ⋮ Nearest common root of a set of polynomials: a structured singular value approach ⋮ Variable projection methods for approximate (greatest) common divisor computations

Uses Software

• MultRoot

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rank and null space calculations using matrix decomposition without column interchanges
• An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
• Fast projection methods for minimal design problems in linear system theory
• Approximate GCD and its application to ill-conditioned algebraic equations
• Geometric state-space theory in linear multivariable control: A status report
• On approximate GCDs of univariate polynomials
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Certified approximate univariate GCDs
• Grassmann invariants, matrix pencils, and linear system properties
• Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation
• Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases
• Partial singular value decomposition algorithm
• More Accurate Bidiagonal Reduction for Computing the Singular Value Decomposition
• Invariance properties, and characterization of the greatest common divisor of a set of polynomials
• Greatest common divisors from generalized sylvester resultant matrices
• An Improved Algorithm for Computing the Singular Value Decomposition
• 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
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• Comparison of algorithms for calculation of g.c.d. of polynomials
• A New Version of the Euclidean Algorith

This page was built for publication: The ERES method for computing the approximate GCD of several polynomials