Fast computation of zeros of polynomial systems with bounded degree under finite-precision (Q5401702)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6268305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast computation of zeros of polynomial systems with bounded degree under finite-precision |
scientific article; zbMATH DE number 6268305 |
Statements
Fast computation of zeros of polynomial systems with bounded degree under finite-precision (English)
0 references
12 March 2014
0 references
Smale's 17th problem
0 references
finite-precision
0 references
round-off error
0 references
complex polynomial systems
0 references
fixed precise algorithm
0 references
variable precise algorithm
0 references
0 references
0.8309547305107117
0 references
0.8261293768882751
0 references
0.8224017024040222
0 references
0.8196991086006165
0 references
0.8154710531234741
0 references
