The paper deals with the iterative solution of a nonlinear operator equation \(F=0\) where F is an analytical multivariate or abstract function having only simple zeros. A very general definition of information and iteration without memory is introduced. The definiton of globally convergent iterations is discussed and the constant of global convergence is defined. It is proved that, for the class \({\mathcal F}_ 1\) of all analytic operators having simple zeros, the constant of global convergence is not larger than 1/2 for any iteration. Furthermore it is proved that any globally convergent iteration is a one-point iteration. A globally convergent nonstationary interpolatory iteration \(I_ 0\) for operators \(F\in {\mathcal F}_ 1\) is constructed where the constant of global convergence is not less than 1/3. The i-th step of this iteration requires the computation of \(F(x_ 0),F'(x_ 0),...,F^{(i-1)}(x_ o)\) and the solution of a polynomial equation of degree i-1. The generalization of \(I_ 0\) to iterations with memory is derived with the constant of global convergence not less than 1/4.
- Any iteration for polynomial equations using linear information has infinite complexity
- Can Any Stationary Iteration Using Linear Information Be Globally Convergent?
- scientific article; zbMATH DE number 3279592 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Optimal radius of convergence of interpolatory iterations for operator equations
- Optimal solution of nonlinear equations
- Some informational requirements for convergence
- Any iteration for polynomial equations using linear information has infinite complexity
- Nonstationary vs. stationary iterative processes
- A note on the ``constructing of nonstationary methods for solving nonlinear equations with raised speed of convergence
- scientific article; zbMATH DE number 3982415 (Why is no real title available?)
- scientific article; zbMATH DE number 2096222 (Why is no real title available?)
- On the Computation of Nonhyperbolic Fixed Points
This page was built for publication: The strength of nonstationary iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796255)
