Message length effects for solving polynomial systems on a hypercube (Q1121641): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PITCON / rank | |||
Normal rank | |||
Revision as of 12:27, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Message length effects for solving polynomial systems on a hypercube |
scientific article |
Statements
Message length effects for solving polynomial systems on a hypercube (English)
0 references
1989
0 references
The authors investigate a recently proposed homotopy algorithm for polynomial systems that is globally convergent with probability one and finds all solutions to the polynomial system. For this homotopy algorithm and a given decomposition strategy, the communication overhead for several possible communication strategies is explored empirically. The experiments were done on an iPSC-32 hypercube.
0 references
global convergence
0 references
parallel implementation on iPSC-32 hypercube
0 references
communication overhead
0 references
homotopy algorithm
0 references
polynomial systems
0 references
decomposition strategy
0 references
communication strategies
0 references
