A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials

Optimization strategies for the approximate GCD problem

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

Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials

Proceedings of the 2006 international symposium on Symbolic and algebraic computation

Computing Approximate GCDs in Ill-conditioned Cases

Proceedings of the 2007 international workshop on Symbolic-numeric computation

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

Proceedings of the 2007 international symposium on Symbolic and algebraic computation

An iterative method for calculating approximate GCD of univariate polynomials

Proceedings of the 2009 international symposium on Symbolic and algebraic computation

The approximate irreducible factorization of a univariate polynomial: revisited

Proceedings of the 2009 international symposium on Symbolic and algebraic computation

GPGCD, an iterative method for calculating approximate GCD, for multiple univariate polynomials

CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing

Extended companion matrix for approximate GCD

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation

Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation

Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation

GPGCD: An iterative method for calculating approximate GCD of univariate polynomials

Theoretical Computer Science