Home

The Strength of Nonstationary Iteration

Grzegorz W. Wasilkowski

Title:
The Strength of Nonstationary Iteration
Author(s):
Wasilkowski, Grzegorz W.
Date:
Type:
Technical reports
Department:
Computer Science
Persistent URL:
Series:
Columbia University Computer Science Technical Reports
Part Number:
CUCS-003-79
Publisher:
Department of Computer Science, Columbia University
Publisher Location:
New York
Abstract:
The is the second of three papers that studies global convergence of iterations using linear information for the solution of nonlinear equations. This paper proves that any globally convergent iteration using linear information has infinite complexity even for the class of scalar complex polynomials having only simple zeros.
Subject(s):
Computer science
Item views
129
Metadata:
text | xml
Suggested Citation:
Grzegorz W. Wasilkowski, 1979, The Strength of Nonstationary Iteration, Columbia University Academic Commons, http://hdl.handle.net/10022/AC:P:11050.

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