Can Any Stationary Iteration Using Linear Information Be Globally Convergent?

  • Authors:
  • G. W. Wasilkowski

  • Affiliations:
  • Department of Mathematics, University of Warsaw, P.K.1 N. 8p. 850, 00-901 Warsaw, Poland and Carnegie-Mellon University, Pittsburgh, Pennsylvania

  • Venue:
  • Journal of the ACM (JACM)
  • Year:
  • 1980

Quantified Score

Hi-index 0.01

Visualization

Abstract

All known globally convergent iterations for the solution of a nonlinear operator equation ƒ(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.