Approximate polynomial greatest common divisors and nearest singular polynomials

A numerical absolute primality test for bivariate polynomials

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

Efficient algorithms for computing the nearest polynomial with constrained roots

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

Report on the SNAP minisymposium at SIAM '98

ACM SIGSAM Bulletin

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

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

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

Towards factoring bivariate approximate polynomials

Proceedings of the 2001 international symposium on Symbolic and algebraic computation

The nearest polynomial with a given zero, and similar problems

ACM SIGSAM Bulletin

East Coast Computer Algebra Day '99 (April 24, 1999): abstracts of invited talks and presented posters

ACM SIGSAM Bulletin

Cited References

Computer algebra handbook

The approximate GCD of inexact polynomials

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

On computing nearest singular hankel matrices

Proceedings of the 2005 international symposium on Symbolic and algebraic computation

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

Signal Processing

Numerical optimization in hybrid symbolic-numeric computation

Proceedings of the 2007 international workshop on Symbolic-numeric computation

Approximate GCDs of polynomials and SOS relaxation

Proceedings of the 2007 international workshop on Symbolic-numeric computation

Global minimization of rational functions and the nearest GCDs

Journal of Global Optimization

Structured total least norm and approximate GCDs of inexact polynomials

Journal of Computational and Applied Mathematics

Approximate GCDs of polynomials and sparse SOS relaxations

Theoretical Computer Science

Nearest multivariate system with given root multiplicities

Journal of Symbolic Computation

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

Computers & Mathematics with Applications

Resultants and neighborhoods of a polynomial

SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific 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

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

Theoretical Computer Science

Extended companion matrix for approximate GCD

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation

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

Computing the nearest singular univariate polynomials with given root multiplicities

Theoretical Computer Science

Guessing singular dependencies

Journal of Symbolic Computation