1979 Reports
The Strength of Nonstationary Iteration
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.
Subjects
Files
-
cucs-003-79.pdf application/pdf 729 KB Download File
More About This Work
- Academic Units
- Computer Science
- Publisher
- Department of Computer Science, Columbia University
- Series
- Columbia University Computer Science Technical Reports, CUCS-003-79
- Published Here
- August 30, 2011