Message length effects for solving polynomial systems on a hypercube (Q1121641): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1086987 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Aurel Galantai / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: PITCON / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0167-8191(89)90015-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2108833034 / rank | |||
Normal rank | |||
Latest revision as of 10:57, 30 July 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
