Home

Can Any Stationary Iteration Using Linear Information Be Globally Convergent?

Grzegorz W. Wasilkowski

Title:
Can Any Stationary Iteration Using Linear Information Be Globally Convergent?
Author(s):
Wasilkowski, Grzegorz W.
Date:
Type:
Technical reports
Department:
Computer Science
Permanent URL:
Series:
Columbia University Computer Science Technical Reports
Part Number:
CUCS-143-80
Abstract:
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.
Subject(s):
Computer science
Item views:
113
Metadata:
text | xml

In Partnership with the Center for Digital Research and Scholarship at Columbia University Libraries/Information Services | Terms of Use