Abstract
This is the second of three papers in which we study global convergence of iterations using linear information for the solution of nonlinear equations. In Wasilkowski [6] we proved that for the class of all analytic scalar complex functions having only simple zeros there exists no globally convergentstationary iteration using linear information. Here we exhibit anonstationary iteration using linear information which is globally convergent even for the multivariate and abstract cases. This demonstrates the strength of nonstationary iteration. In Wasilkowski [7] we shall prove that any globally convergent iteration using linear information hasinfinite complexity even for the class of scalar complex polynomials having only simple zeros.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ortega, J. M. andReinboldt, W. C.,Iterative solution of nonlinear equations in several variables. Academic Press, New York, 1970.
Rall, L. B.,Computational solution of nonlinear operator equations. John Wiley and Sons, New York, 1969.
Traub, J. F.,Iterative methods for the solution of equations. Prentice Hall, Englewood Cliffs, N.J., 1964.
Traub, J. F. andWoźniakowski, H.,Optimal radius of convergence of interpolatory iterations for operator equations. Department of Computer Science Report, Carnegie-Mellon University, 1976. See also Aequationes Math.21 (1980), 159–172.
Traub, J. F. andWoźniakowski, H.,General theory of optimal error algorithms and analytic complexity, part B: Iterative information model. Department of Computer Science Report, Carnegie-Mellon University, 1978. See alsoA General Theory of Optimal Algorithms, Academic Press, New York, 1980.
Wasilkowski, G. W.,Can any stationary iteration using linear information be globally convergent? Department of Computer Science Report, Carnegie-Mellon University, 1978. See also J. Assoc. Comput. Mach.27 (1981), 263–269.
Wasilkowski, G. W.,Any iteration for polynomial equations using linear information has infinite complexity. Department of Computer Science Report, Carnegie-Mellon University, 1979. To appear in J. Theoret. Comput. Sci.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wasilkowski, G.W. The strength of nonstationary iteration. Aeq. Math. 24, 243–260 (1982). https://doi.org/10.1007/BF02193047
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02193047