Title: Approximate polynomial problems and associated tools
Authors: S. Graillat and Ph. Langlois
Institution: University of Perpignan, France.
When polynomials have limited accuracy coeffcients or are computed in
finite precision, classical algebraic problems such that GCD, primality,
divisibility have to be redefined. Such approximate algebraic problems
are still challenging open questions in the symbolic and numerical
computation communities. In this talk, we focus on a numerical and
graphical tool: the pseudozero set. We present how pseudozeros may
provide solutions to some approximate algebraic problems like polynomial
stability and primality. We compare polynomial pseudozeros and
polynomial interval computation.
Key words: pseudozeros, polynomial, interval polynomial, stability,
approximate GCD, approximate primality, finite precision.