Approximate GCD and its application to ill-conditioned algebraic equations

The singular value decomposition for polynomial systems

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation

Optimization strategies for the approximate GCD problem

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation

Approximate polynomial Gcds, Padé approximation, polynomial zeros and bipartite graphs

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

A theorem for separating close roots of a polynomial and its derivatives

ACM SIGSAM Bulletin

A fast algorithm for solving the Sylvester structured total least squares problem

Signal Processing

Structured matrix-based methods for polynomial ∈-gcd: analysis and comparisons

Proceedings of the 2007 international symposium on Symbolic and algebraic computation

Minimum converging precision of the QR-factorization algorithm for real polynomial GCD

Proceedings of the 2007 international symposium on Symbolic and algebraic computation

A new Gröbner basis conversion method based on stabilization techniques

Theoretical Computer Science

Computing nearest Gcd with certification

Proceedings of the 2009 conference on Symbolic numeric computation

The ERES method for computing the approximate GCD of several polynomials

Applied Numerical Mathematics

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

Computers & Mathematics with Applications

On the Computation of the GCD of 2-D Polynomials

International Journal of Applied Mathematics and Computer Science

Blind image deconvolution via fast approximate GCD

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation

A subdivision method for computing nearest gcd with certification

Theoretical Computer Science

A hybrid approach for normal factorization of polynomials

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II

An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix

Journal of Computational and Applied Mathematics

Approximately singular systems and ill-conditioned polynomial systems

CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing

On the complexity of computing the GCD of two polynomials via Hankel matrices

ACM Communications in Computer Algebra

Resultant matrices and the computation of the degree of an approximate greatest common divisor of two inexact Bernstein basis polynomials

Computer Aided Geometric Design

Pseudospectra of exponential matrix polynomials

Theoretical Computer Science

Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials

Journal of Computational and Applied Mathematics