Massively parallel search for linear factors in polynomials with many variables

Abstract

We give here an effective massively parallel algorithm, searching for all linear factors in a multivariate polynomial with complex coefficients. This algorithm is multirecurrent and needs essentially polynomial manipulation tools such as variable changing, partial derivatives, and root finding of univariate polynomials. It also uses Bombieri's scalar product of polynomials. The parallel message-passing algorithm is implemented on a Connection Machine CM5 and is obtained by a parallelization of the recurrences in the sequential algorithm.