Massively parallel search for linear factors in polynomials with many variables (Q1366832)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Massively parallel search for linear factors in polynomials with many variables |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Massively parallel search for linear factors in polynomials with many variables |
scientific article |
Statements
Massively parallel search for linear factors in polynomials with many variables (English)
0 references
22 January 1998
0 references
Search for all linear factors in a multi-variate polynomial of degree \(m\) with \(N\) variables. Theory how to find them by recursive polynomial reductions. Parallelization by distributing the work to free processors. Acceptable efficiency only for number of processors \(p <m\). Implementation with message passing on a CM5 (not using the vector units).
0 references
parallel computation
0 references
linear factors
0 references
polynomial
0 references
recursive polynomial reductions
0 references
