Sciweavers

TCS
2008
13 years 4 months ago
Approximate GCDs of polynomials and sparse SOS relaxations
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
Bin Li, Jiawang Nie, Lihong Zhi
SAC
2006
ACM
13 years 10 months ago
Pseudozero set of interval polynomials
Interval polynomials are useful to describe perturbed polynomials. We present a graphical tool to describe how perturbations of the polynomial coefficients affect its zeros witho...
Stef Graillat, Philippe Langlois