On approximate GCDs of univariate polynomials

Optimization strategies for the approximate GCD problem

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

Efficient algorithms for computing the nearest polynomial with a real root and related problems

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation

Pseudofactors of multivariate polynomials

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation

The nearest polynomial with a given zero, and similar problems

ACM SIGSAM Bulletin

A method computing multiple roots of inexact polynomials

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation

On computing nearest singular hankel matrices

Proceedings of the 2005 international symposium on Symbolic and algebraic computation

The nearest polynomial with a given zero, revisited

ACM SIGSAM Bulletin

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

Locating real multiple zeros of a real interval polynomial

Proceedings of the 2006 international symposium on Symbolic and algebraic computation

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

On real factors of real interval polynomials

Proceedings of the 2007 international symposium on Symbolic and algebraic computation

Global minimization of rational functions and the nearest GCDs

Journal of Global Optimization

Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars

Proceedings of the twenty-first international symposium on Symbolic and algebraic computation

Approximate GCDs of polynomials and sparse SOS relaxations

Theoretical Computer Science

Nearest multivariate system with given root multiplicities

Journal of Symbolic Computation

On real factors of real interval polynomials

Journal of Symbolic 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

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 polynomial gcd: Small degree and small height perturbations

Journal of Symbolic Computation

Blind image deconvolution via fast approximate GCD

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation

Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method

Proceedings of the 2010 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

A subdivision method for computing nearest gcd with certification

Theoretical Computer Science

Symbolic-numeric solution of Ill-conditioned polynomial systems (survey talk overview) (invited talk)

CASC'11 Proceedings of the 13th international conference on Computer algebra in scientific computing

Approximate polynomial GCD over integers

Journal of Symbolic Computation

The nearest complex polynomial with a zero in a given complex domain

Theoretical Computer Science

Approximate GCD of several univariate polynomials with small degree perturbations

Journal of Symbolic Computation

Extended companion matrix for approximate GCD

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation

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

Computer Aided Geometric Design

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

Theoretical Computer Science

Review: Recent progress on variable projection methods for structured low-rank approximation

Signal Processing

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

Minimizing rational functions by exact Jacobian SDP relaxation applicable to finite singularities

Journal of Global Optimization