Any iteration for polynomial equations using linear information has infinite complexity (Q1170011)
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: Any iteration for polynomial equations using linear information has infinite complexity |
scientific article; zbMATH DE number 3782304
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Any iteration for polynomial equations using linear information has infinite complexity |
scientific article; zbMATH DE number 3782304 |
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
