Home

Any Iteration for Polynomial Equations Using Linear Information Has Infinite Complexity

Grzegorz W. Wasilkowski

Title:
Any Iteration for Polynomial Equations Using Linear Information Has Infinite Complexity
Author(s):
Wasilkowski, Grzegorz W.
Date:
Type:
Technical reports
Department:
Computer Science
Persistent URL:
Series:
Columbia University Computer Science Technical Reports
Part Number:
CUCS-145-79
Publisher:
Department of Computer Science, Columbia University
Publisher Location:
New York
Abstract:
This is the third paper in which is studied iterations using linear information for the solution of nonlinear information. Here is studied the complexity of such iterations.
Subject(s):
Computer science
Item views
397
Metadata:
text | xml
Suggested Citation:
Grzegorz W. Wasilkowski, 1979, Any Iteration for Polynomial Equations Using Linear Information Has Infinite Complexity, Columbia University Academic Commons, http://hdl.handle.net/10022/AC:P:11054.

Center for Digital Research and Scholarship at Columbia University Libraries | Terms of Use | Copyright