Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

Massively parallel search for linear factors in polynomials with many variables

Published: 01 September 1997 Publication History

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.

References

[1]
An improved multivariate polynomials factoring algorithm. Math. Comp. v32 i144. 1215-1231.
[2]
Factoring polynomials over large finite fields. Math. Comp. v34. 713-735.
[3]
On Hensel factorisation I. Journal of Number Theory. v1.
[4]
Factoring multivariate polynomials over the integers. Math. Comp. v29. 935-950.
[5]
B. Beauzamy, J-L. Frot, C. Millour, Massively parallel computation on many-variable polynomials: when seconds count. Special volume Maths and Computer Science, Annals of Maths and IA, (M. Nivat and S. Grigorieff, editors).
[6]
J. Dégot, Massively parallel computation of many-variable polynomial interpolation, To appear in Applied Math. Comp.
[7]
Massively parallel factorisation of polynomials with many non-commuting variables. Journal of Theoretical Computer Science A. v168.
[8]
Products of polynomials in many variables. In: Journal of Number Theory, Vol. 36. pp. 219-245.
[9]
Differential identities. Transactions of the A. M. S. v347 i7. 2607-2619.

Cited By

View all
  • (2004)Absolute polynomial factorization in two variables and the knapsack problemProceedings of the 2004 international symposium on Symbolic and algebraic computation10.1145/1005285.1005300(87-94)Online publication date: 4-Jul-2004

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Applied Mathematics and Computation
Applied Mathematics and Computation  Volume 85, Issue 2-3
Sept. 1, 1997
206 pages
ISSN:0096-3003
Issue’s Table of Contents

Publisher

Elsevier Science Inc.

United States

Publication History

Published: 01 September 1997

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 01 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2004)Absolute polynomial factorization in two variables and the knapsack problemProceedings of the 2004 international symposium on Symbolic and algebraic computation10.1145/1005285.1005300(87-94)Online publication date: 4-Jul-2004

View Options

View options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media