Condition length and complexity for the solution of polynomial systems (Q506608)
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 6679677
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Condition length and complexity for the solution of polynomial systems |
scientific article; zbMATH DE number 6679677 |
Statements
Condition length and complexity for the solution of polynomial systems (English)
0 references
1 February 2017
0 references
Smale's 17th problem is on existence of an algorithm which finds an approximate zero of a polynomial system in average polynomial time. In this paper an intermediate result on the average value of the condition number is proved. The new achievements are on: the complexity of a randomized algorithm, the average of the condition number of polynomial systems, the complexity of finding a single zero of polynomial systems.
0 references
polynomial systems
0 references
homotopy methods
0 references
complexity estimates
0 references
Smale's 17th problem
0 references
algorithm
0 references
approximate zero
0 references
condition number
0 references
0 references
0 references
0.94938123
0 references
0.9163115
0 references
0.9060695
0 references
0.9040879
0 references
0.9015636
0 references
0.8987814
0 references
0.8940485
0 references
0.89364463
0 references
0.89120734
0 references
