Any iteration for polynomial equations using linear information has infinite complexity
- 1 January 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 22 (1-2) , 195-208
- https://doi.org/10.1016/0304-3975(83)90144-5
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Can Any Stationary Iteration Using Linear Information Be Globally Convergent?Journal of the ACM, 1980