More on pseudozeros for univariate polynomials
Stef Graillat, Philippe Langlois, Paul Alduy · 2004
When polynomials have limited accuracy coefficients or are computed in finite pre-cision, classical algebraic problems such that GCD, primality, divisibility have to be redefined. Such approximate algebraic problems are still challenging open questions in the symbolic computation community. In this paper, we focus on a numerical and graphical tool: the pseudozero set. We show how pseudozeros may provide solutions to some approximate algebraic problems like polynomial stability and primality.