Computation of approximate polynomial GCDs and an extension

Univariate polynomials: nearly optimal algorithms for factorization and rootfinding

Proceedings of the 2001 international symposium on Symbolic and algebraic computation

Symbolic and numeric methods for exploiting structure in constructing resultant matrices

Journal of Symbolic Computation

Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding

Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001

Bernstein-Bezoutian matrices

Theoretical Computer Science - Algebraic and numerical algorithm

Numerical factorization of multivariate complex polynomials

Theoretical Computer Science - Algebraic and numerical algorithm

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

Structured total least norm and approximate GCDs of inexact polynomials

Journal of Computational and Applied Mathematics

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 amended DSeSC power method for polynomial root-finding

Computers & Mathematics with Applications

Method for finding multiple roots of polynomials

Computers & Mathematics with Applications

Approximate polynomial gcd: Small degree and small height perturbations

Journal of Symbolic Computation

A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix

Journal of Computational and Applied Mathematics

Blind image deconvolution via fast approximate GCD

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

New progress in real and complex polynomial root-finding

Computers & Mathematics with Applications

A subdivision method for computing nearest gcd with certification

Theoretical Computer Science

Root-finding by expansion with independent constraints

Computers & Mathematics with Applications

Approximate polynomial GCD over integers

Journal of Symbolic Computation

Approximate GCD of several univariate polynomials with small degree perturbations

Journal of Symbolic Computation

The computation of multiple roots of a polynomial

Journal of Computational and Applied Mathematics

Ruppert matrix as subresultant mapping

CASC'07 Proceedings of the 10th international conference on Computer Algebra in Scientific Computing

GPGCD: An iterative method for calculating approximate GCD of univariate 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