Detection and validation of clusters of polynomial zeros

The singular value decomposition for polynomial systems

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

Approximate polynomial greatest common divisors and nearest singular polynomials

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation

Analysis of zero clusters in multivariate polynomial systems

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation

A reordered Schur factorization method for zero-dimensional polynomial systems with multiple roots

ISSAC '97 Proceedings of the 1997 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

Improvement of convergence of an iterative method for finding polynomial factors of analytic functions

Journal of Computational and Applied Mathematics - Special issue: Proceedings of the 9th International Congress on computational and applied mathematics

The subresultant and clusters of close roots

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

Enclosing clusters of zeros of polynomials

Journal of Computational and Applied Mathematics

The approximate GCD of inexact polynomials

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation

Approximate radical of ideals with clusters of roots

Proceedings of the 2006 international symposium on Symbolic and algebraic computation

A verified method for bounding clusters of zeros of analytic functions

Journal of Computational and Applied Mathematics - Special issue: Scientific computing, computer arithmetic, and validated numerics (SCAN 2004)

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

Nearest multivariate system with given root multiplicities

Journal of Symbolic Computation

Computing nearest Gcd with certification

Proceedings of the 2009 conference on Symbolic numeric computation

Computing clustered close-roots of univariate polynomials

Proceedings of the 2009 conference on Symbolic numeric computation

Exact real computation in computer algebra

SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation

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

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

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

Computer Aided Geometric Design