Testing polynomial primality with pseudozeros
Stef Graillat, Philippe Langlois · 2003
When polynomials have limited accuracy coecien ts or are computed in nite precision, classical algebraic problems such that GCD, primality, divisibility have to be redened. Such approximate algebraic problems are still challenging open questions in the symbolic computation community. In this paper, we show how a numerical tool, the pseudozero set, may provide solutions to some approximate algebraic problems. We propose a graphical answer to test polynomial primality.