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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
