Can Any Stationary Iteration Using Linear Information Be Globally Convergent?
All known globally convergent iterations for the solution of a nonlinear operator equation f(x) = 0 are either nonstationary or use nonlinear information. It is asked whether there exists a globally convergent stationary iteration which uses linear information. It is proved that even if global convergence is defined in a weak sense, there exists no such iteration for as simple a class of problems as the set of all analytic complex functions having only simple zeros. It is conjectured that even for the class of all real polynomials which have real simple zeros there does not exist a globally convergent stationary iteration using linear information.
- cucs-143-80.pdf application/pdf 322 KB Download File
More About This Work
- Academic Units
- Computer Science
- Department of Computer Science, Columbia University
- Columbia University Computer Science Technical Reports, CUCS-143-80
- Published Here
- October 19, 2011