Vy. Pan, COMPUTING X(M) MOD P(X) AND AN APPLICATION TO SPLITTING A POLYNOMIAL INTO FACTORS OVER A FIXED DISC, Journal of symbolic computation, 22(4), 1996, pp. 377-380
Citations number
16
Categorie Soggetti
Mathematics,"Computer Sciences, Special Topics",Mathematics,"Computer Science Theory & Methods
Koenig's theorem is a well-known basis for fast splitting a polynomial
into factors over a fixed disc in the complex plane. We simplify the
computation of such factors by means of its reduction to solving a ban
ded triangular Toeplitz linear system of equations. The technique used
may be of some interest in its own right, in particular, due to its p
ossible extension to computing a power module a polynomial. (C) 1996 A
cademic Press Limited.