A globally convergent parallel algorithm for zeros of polynomial systems (Q3484271)
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: Publication:3484271 |
scientific article; zbMATH DE number 4155770
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A globally convergent parallel algorithm for zeros of polynomial systems |
scientific article; zbMATH DE number 4155770 |
Statements
A globally convergent parallel algorithm for zeros of polynomial systems (English)
0 references
1989
0 references
zeros of polynomial systems
0 references
global convergence
0 references
homotopy method
0 references
parallel computation
0 references
0 references
0 references
0 references
0.8925592303276062
0 references
0.8471704721450806
0 references
0.8373732566833496
0 references
0.8248849511146545
0 references
