Approximate GCDs of polynomials and SOS relaxation

Authors:
Bin Li;Jiawang Nie;Lihong Zhi
Affiliations:
Chinese Academy of Sciences, Beijing, China;University of Minnesota, Minneapolis, MN;Chinese Academy of Sciences, Beijing, China
Venue:
Proceedings of the 2007 international workshop on Symbolic-numeric computation
Year:
2007

Approximate polynomial greatest common divisors and nearest singular polynomials

ISSAC '96 Proceedings of the 1996 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
Nearest singular polynomials

Journal of Symbolic Computation - Special issue on symbolic numeric algebra for polynomials
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
Global Optimization with Polynomials and the Problem of Moments

SIAM Journal on Optimization
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

Hi-index	0.00