The Strength of Nonstationary Iteration

Wasilkowski, Grzegorz W.

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.


More About This Work

Academic Units
Computer Science
Department of Computer Science, Columbia University
Columbia University Computer Science Technical Reports, CUCS-003-79
Published Here
August 30, 2011