Condition length and complexity for the solution of polynomial systems (Q506608): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1507.03896 / rank | |||
Normal rank | |||
Revision as of 14:40, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Condition length and complexity for the solution of polynomial systems |
scientific article |
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
