Any iteration for polynomial equations using linear information has infinite complexity (Q1170011)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Any iteration for polynomial equations using linear information has infinite complexity |
scientific article |
Statements
Any iteration for polynomial equations using linear information has infinite complexity (English)
0 references
1983
0 references
polynomial equations
0 references
linear information
0 references
globally convergent iterations
0 references
complexity
0 references
